Related papers: Size sensitive packing number for Hamming cube and…
In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves not just lower bounds for…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
Given $\ut\in\Rm$ and any norm $\Vert.\Vert$ on $\Rm$, we consider "inhomogeneously singular" vectors in $\Rm$ that admit an integer vector solution $(q,\underline{p})=(q,p_1,\ldots,p_m)$ to the system \[ 1\leq q\leq Q, \qquad \Vert…
Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…
We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
The two-dimensional Ising model with Brascamp-Kunz boundary conditions has a partition function more amenable to analysis than its counterpart on a torus. This fact is exploited to exactly determine the full finite-size scaling behaviour of…
The fundamental lower size limit in wavelength selecting structures is explored with the aid of the Heisenberg uncertainty principle. The analysis shows that for a given wavelength selectivity resonating structures with optical feedback…
We demonstrate that the fraction of pattern sets that can be stored in single- and hidden-layer perceptrons exhibits finite size scaling. This feature allows to estimate the critical storage capacity \alpha_c from simulations of relatively…
We determine the Hausdorff, packing and box-counting dimension of a family of self-affine sets generalizing Bara\'nski carpets. More specifically, we fix a Bara\'nski system and allow both vertical and horizontal random translations, while…
Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary…
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing…
We introduce a toy model implementing the proposal of using a custodial symmetry to protect the Zbb coupling from large corrections. This "doublet-extended standard model" adds a weak doublet of fermions (including a heavy partner of the…
The jamming transition of particles with finite-range interactions is characterized by a variety of critical phenomena, including power law distributions of marginal contacts. We numerically study a recently proposed simple model of…
Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has…
An isoperimetric inequality on the Hamming cube for exponents $\beta\ge 0.50057$ is proved, achieving equality on any subcube. This was previously known for $\beta\ge \log_2(3/2)\approx 0.585$. Improved bounds are also obtained at the…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…