Related papers: Error recognition in the Cantor cube
A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…
We present the characterization of metric spaces that are micro-, macro- or bi-uniformly equivalent to the extended Cantor set $\{\sum_{i=-n}^\infty\frac{2x_i}{3^i}:n\in\IN ,\;(x_i)_{i\in\IZ}\in\{0,1\}^\IZ\}\subset\IR$, which is…
In 1994, John Cobb asked: given $N>m>k>0$, does there exist a Cantor set in $\mathbb R^N$ such that each of its projections into $m$-planes is exactly $k$-dimensional? Such sets were described for $(N,m,k)=(2,1,1)$ by L.Antoine (1924) and…
We show that, consistently, there exists a Borel set B subset Cantor admitting a sequence (eta_alpha:alpha<lambda) of distinct elements of Cantor such that (eta_alpha+B) cap (eta_beta+B) is uncountable for all alpha,beta<lambda but with no…
The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…
In relation to the Erd\H os similarity problem (show that for any infinite set $A$ of real numbers there exists a set of positive Lebesgue measure which contains no affine copy of $A$) we give some new examples of infinite sets which are…
The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary…
We consider a point-to-point communication system, where in addition to the encoder and the decoder, there is a helper that observes non-causally the realization of the noise vector and provides a (lossy) rate-$R_{\mbox{\tiny h}}$…
Mayers, Lo and Chau argued that all quantum bit commitment protocols are insecure, because there is no way to prevent an Einstein-Podolsky-Rosen (EPR) cheating attack. However, Yuen presented some protocols which challenged the previous…
In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…
We consider the problem of the classical simulation of quantum measurements in the scenario of communication complexity. Regev and Toner (2007) have presented a 2-bit protocol which simulates one particular correlation function arising from…
An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…
In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent…
We generalize the classical Monge-Kantorovich duality--typically established for tight (Radon) probability measures--to separable Baire probability measures, which are strictly more general than tight measures on completely regular…
Hausdorff's paradoxical decomposition of a sphere with countably many points removed (the main precursor of the Banach-Tarski paradox) actually produced a partition of this set into three pieces A,B,C such that A is congruent to B (i.e.,…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
Representing real numbers using convenient numeration systems (integer bases, $\beta$-numeration, Cantor bases, etc.) has been a longstanding mathematical challenge. This paper focuses on Cantor real bases and, specifically, on automatic…
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain operator space as the quantum generalisation of the adjacency matrix, in terms of…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…