Related papers: Boundary effect of deterministic dense coding
For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
We examine the Bayes-consistency of a recently proposed 1-nearest-neighbor-based multiclass learning algorithm. This algorithm is derived from sample compression bounds and enjoys the statistical advantages of tight, fully empirical…
In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determine the maximal cross-correlation amplitude of these codebooks. We…
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…
The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…
We consider first-order conservative systems of particles with binary Coulomb interactions in the mean-field scaling regime in dimensions $d\geq 3$. We show that if at some time, the associated sequence of empirical measures converges in a…
The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…
We investigate the disorder-induced localization transition in Bose-Einstein condensates for the Anderson and Aubry-Andre models in the non-interacting limit using exact diagonalization. We show that, in addition to the standard superfluid…
We study zero-range processes which are known to exhibit a condensation transition, where above a critical density a non-zero fraction of all particles accumulates on a single lattice site. This phenomenon has been a subject of recent…
In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary…
In a recent letter [Phys.Rev.Lett. {\bf 30}, 3269 (1995), chao-dyn/9510011], we reported that a macroscopic chaotic determinism emerges in a multistable system: the unidirectional motion of a dissipative particle subject to an apparently…
In this paper, we will give an upper bound of the number of auxiliary hypersurfaces in the determinant method, which reformulates an unpublished work of Salberger by Arakelov geometry. One of the key constants will be determined by the…
We consider partially hyperbolic diffeomorphisms $f$ with a one-dimensional central direction such that the unstable entropy exceeds the stable entropy. Our main result proves that such maps have a finite number of ergodic measures of…
This work continues the study of linear error correcting codes against adversarial insertion deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and Li \cite{CGHL21} showed the existence of asymptotically…
It is shown that the classical motion of massive particles in hyperbolic spaces $H^D$ has a bounded character in $D-1$ coordinates. Studying the Dirac equation, it is found that a bounded character of the classical motion corresponds to the…
Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…
This paper considers the problem of variable-length coding over a discrete memoryless channel (DMC) with noiseless feedback. The paper provides a stochastic control view of the problem whose solution is analyzed via a newly proposed…
We present a number of explicit calculations of Renyi and entanglement entropies in situations where the entangling surface intersects the boundary in $d$-dimensional Minkowski spacetime. When the boundary is a single plane we compute the…
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding,…