Related papers: How the no-cloning theorem got its name
This is a 20-year old review on singularities and singularity theorems. The main reason to submit it now is -apart from increasing its availability- to correct a very strange error that appears in the journal's online version: it contains…
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets about them. However, an adversary that obtains a NIZK proof may be able to clone this proof and distribute arbitrarily many copies of it to…
Allegedly, Brouwer discovered his famous fixed point theorem while stirring a cup of coffee and noticing that there is always at least one point in the liquid that does not move. In this paper, based on a talk in honour of Brouwer at the…
This paper has been withdrawn by the authors. There was an erroneous estimate of the degree of a transformed polynomial, making the method appear more effective than it really is. We thank an anonymous referee for pointing out this error.
This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…
On being told that a piece of work he thought was his discovery had duplicated an earlier mathematician's work, Larry Shepp once replied "Yes, but when {\em I} discovered it, it {\em stayed} discovered". In this spirit we give discussion…
We correct a mistake on the citation of JSJ theory in \cite{Ni}. Some arguments in \cite{Ni} are also slightly modified accordingly.
We give a direct proof of the main result of the paper "Homomorphisms with respect to a function" by K. Boulabiar and F. Gdara [1] without using the Axiom of Choice.
This version corrects an inportant typographical error in Eq. 17. COMMENTS, FOR THE RECORD: A referees reoprt from Phys. Rev. Lett. read in part ``The first named author has appreciated my exceptionally long report. He has read and well…
Suppose one needs to change the direction of at least $\epsilon n^2$ edges of an $n$-vertex tournament $T$, in order to make it $H$-free. A standard application of the regularity method shows that in this case $T$ contains at least…
A new general all terminal network reliability factorization theorem is stated. We relegate the proof to a forthcoming second part paper.
To celebrate the 60th birthday of Charles H.Bennett I (1) publicly announce my referee reports for the original dense coding and teleportation papers, (2) present a very economical solution to the Bernstein-Vazirani problem that does not…
Craig's interpolation theorem (Craig 1957) is an important theorem known for propositional logic and first-order logic. It says that if a logical formula $\beta$ logically follows from a formula $\alpha$, then there is a formula $\gamma$,…
Haag's theorem cries out for explanation and critical assessment: it sounds the alarm that something is (perhaps) not right in one of the standard way of constructing interacting fields to be used in generating predictions for scattering…
Based on the seminal work by John T. Sheridan [1] we discuss the usefulness and validity of simple diffraction theories frequently used to determine and characterize optical holographic gratings. Experimental investigations obtained in…
This paper has been withdrawn due to an error in section 3.
In a preceding paper [E.J.ofProb.34,860-892,(2006)], we proved a sewing lemma which was a key result for the study of Holder continuous functions. In this paper we give a non-commutative version of this lemma with some applications.
This paper has been withdrawn by the author.
Some mistaken reasonings at the end of the paper omitted.
We introduce the concept of cloning for classes of observables and classify cloning machines for qubit systems according to the number of parameters needed to describe the class under investigation. A no-cloning theorem for observables is…