Related papers: Size sensitive packing number for Hamming cube and…
We obtain mproved bounds for one bit sensing. For instance, let $ K_s$ denote the set of $ s$-sparse unit vectors in the sphere $ \mathbb S ^{n}$ in dimension $ n+1$ with sparsity parameter $ 0 < s < n+1$ and assume that $ 0 < \delta < 1$.…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve…
We study the structure of sets $S\subseteq\{0, 1\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\subseteq\{0, 1\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving…
We analyze a model for spin squeezing based on the so-called counter-twisting Hamiltonian, including the effects of dissipation and finite system size. We discuss the conditions under which the Heisenberg limit, i.e. phase sensitivity…
We discuss the high density behavior of a system of hard spheres of diameter d on the hypercubic lattice of dimension n, in the limit n -> oo, d -> oo, d/n=delta. The problem is relevant for coding theory. We find a solution to the…
The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…
Let $\mbox{ V}(n,d,q)$ stand for the $q$--ary Hamming spheres. Let $\mbox{ C}\subseteq (q)^n$ denote a tuple system such that $\mbox{ C}\subseteq \cup_{i=0}^s \mbox{ V}(n,d_i,q)$, where $d_1<\ldots <d_s$. We give here a general upper bound…
We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…
We explore and refine techniques for estimating the Hausdorff dimension of exceptional sets and their diffeomorphic images. Specifically, we use a variant of Schmidt's game to deduce the strong C^1 incompressibility of the set of badly…
In addition to the standard scaling rules relating critical exponents at second order transitions, hyperscaling rules involve the dimension of the model. It is well known that in canonical Ising models hyperscaling rules are modified above…
We carry out a finite size scaling analysis of the jamming transition in frictionless bi-disperse soft core disks in two dimensions. We consider two different jamming protocols: (i) quench from random initial positions, and (ii) quasistatic…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
Athermal packings of soft repulsive spheres exhibit a sharp jamming transition in the thermodynamic limit. Upon further compression, various structural and mechanical properties display clean power-law behavior over many decades in…
Models often need to be constrained to a certain size for them to be considered interpretable. For example, a decision tree of depth 5 is much easier to understand than one of depth 50. Limiting model size, however, often reduces accuracy.…
We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set. For subspaces and several…
We numerically investigate hyperuniformity in two-dimensional frictionless jammed packings of bidisperse systems. Hyperuniformity is characterized by the suppression of density fluctuations at large length scales, and the structure factor…
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and…
This articles presents a simulation study of the applicability of the Rosenfeld entropy scaling to the systems which can not be approximated by effective hard spheres. Three systems are studied: Herzian spheres, Gauss Core Model and soft…
A finite size scaling is applied to the Yang-Lee zeros of the grand canonical partition function for the 2-D Hubbard model in the complex chemical potential plane. The logarithmic scaling of the imaginary part of the zeros with the system…