Concept

Proof by contradiction

Related publications (100)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Proof of a conjecture by Gazeau et al. using the Gould-Hopper polynomials

Olivier Lévêque

We provide here some probabilistic interpretations of the generalized binomial distributions proposed by Gazeau et al. ["Generating functions for generalized binomial distributions," J. Math. Phys. 53, 103304 (2012)]. In the second part, we prove the "stro ...

Amer Inst Physics2013

On-the-Fly Kinetics of Enzymatic Racemization Using Deuterium NMR in DNA-Based Chiral Oriented Media

Geoffrey Bodenhausen

We report the in situ and real-time monitoring of the interconversion of L- and D-alanine-d(3) by alanine racemase from Bacillus stearothermophilus directly observed by H-2 NMR spectroscopy in anisotropic phase. The enantiomers are distinguished by the dif ...

American Chemical Society2013

Passing to the limit in maximal slope curves: from a regularized Perona–Malik equation to the total variation flow

Maria Colombo

We prove that solutions of a mildly regularized Perona–Malik equation converge, in a slow time scale, to solutions of the total variation flow. The convergence result is global-in-time, and holds true in any space dimension. The proof is based on the gener ...

2012

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

Exploiting the ALICE HLT for PROOF by scheduling of Virtual Machines

Marco Meoni

The HLT (High-Level Trigger) group of the ALICE experiment at the LHC has prepared a virtual Parallel ROOT Facility (PROOF) enabled cluster (HAF - HLT Analysis Facility) for fast physics analysis, detector calibration and reconstruction of data samples. Th ...

Iop Publishing Ltd, Dirac House, Temple Back, Bristol Bs1 6Be, England2011

Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Martin Biely

Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively sim ...

Springer2011

Slow Time Behavior of the Semidiscrete Perona–Malik Scheme in One Dimension

Maria Colombo

We consider the long time behavior of the semidiscrete scheme for the Perona-Malik equation in one dimension. We prove that approximated solutions converge, in a slow time scale, to solutions of a limit problem. This limit problem evolves piecewise constan ...

2011

On the Brauer group of diagonal quartic surfaces

Evis Ieronymou

We obtain an easy sufficient condition for the Brauer group of a diagonal quartic surface D over Q to be algebraic. We also give an upper bound for the order of the quotient of the Brauer group of D by the image of the Brauer group of Q. The proof is based ...

2011

Polymer Coiled-Coil Conjugates: Potential for Development as a New Class of Therapeutic “Molecular Switch”

Harm-Anton Klok

Polymer therapeutics, including polymeric drugs and polymer-protein conjugates, are clinically established as first-generation nanomedicines. Knowing that the coiled-coil peptide motif is fundamentally important in the regulation of many cellular and patho ...

2011

Faster and Smoother - VSH Revisited

Juraj Sarinay

We reconsider the provably collision resistant Very Smooth Hash and propose a small change in the design aiming to improve both performance and security. While the original proofs of security based on hardness of factoring or discrete logarithms are preser ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011