English
Related papers

Related papers: The Sphere Packing Bound via Augustin's Method

200 papers

We obtain upper bounds for the Steklov eigenvalues of warped products $\Omega\times_h\Sigma$, where $\Omega$ is a compact Riemannian manifold with boundary and $\Sigma$ is a closed Riemannian manifold. These bounds involve the volume of…

Spectral Theory · Mathematics 2025-12-18 Jade Brisson , Bruno Colbois , Alexandre Girouard , Katie Gittins

We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density…

Metric Geometry · Mathematics 2015-10-05 Samuel Reid

A fundamental quantity of interest in Shannon theory, classical or quantum, is the error exponent of a given channel $W$ and rate $R$: the constant $E(W,R)$ which governs the exponential decay of decoding error when using ever larger…

Quantum Physics · Physics 2025-02-26 Joseph M. Renes

We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…

Disordered Systems and Neural Networks · Physics 2015-05-13 Indaco Biazzo , Francesco Caltagirone , Giorgio Parisi , Francesco Zamponi

Define the superball with radius $r$ and center ${\boldsymbol 0}$ in $\mathbb{R}^n$ to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}^2+\cdots+x_{k_{j+1}}^2\right)^{p/2}\leq…

Metric Geometry · Mathematics 2022-06-22 Chengfei Xie , Gennian Ge

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…

Quantum Physics · Physics 2016-01-01 William Matthews , Stephanie Wehner

The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the alpha-x plane of sphere radius ratio alpha and relative concentration x are at the Kepler limit alpha = 1,…

Statistical Mechanics · Physics 2015-05-30 Adam B. Hopkins , Yang Jiao , Frank H. Stillinger , Salvatore Torquato

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…

Soft Condensed Matter · Physics 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…

Quantum Physics · Physics 2025-01-09 Michael G. Jabbour , Nilanjana Datta

We prove sphere packing density bounds in hyperbolic space (and more generally irreducible symmetric spaces of noncompact type), which were conjectured by Cohn and Zhao and generalize Euclidean bounds by Cohn and Elkies. We work within the…

Metric Geometry · Mathematics 2026-03-23 Maximilian Wackenhuth

The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar [10], Dhar et al. [11]) which serves as the standard model of self-organized criticality. The transience class of a sandpile is defined as the maximum number…

Mathematical Physics · Physics 2016-11-26 Ayush Choure , Sundar Vishwanathan

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Ulrich G. Schuster , Helmut Bölcskei , Shlomo Shamai

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…

Metric Geometry · Mathematics 2023-07-12 Veit Elser

Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work, we show that the lower bound on the…

Data Structures and Algorithms · Computer Science 2026-03-31 Klaus Jansen , Felix Ohnesorge , Lis Pirotton , Malte Tutas

We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…

Metric Geometry · Mathematics 2008-12-10 Gilbert Muraz , Jean-Louis Verger-Gaugry

We consider constellations of disks which are unions of disjoint hyperbolic disks in the unit disk with fixed radii and unfixed centers. We study the problem of maximizing the conformal capacity of a constellation with a fixed number of…

Complex Variables · Mathematics 2025-03-25 Harri Hakula , Mohamed M. S. Nasser , Matti Vuorinen

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…

Information Theory · Computer Science 2026-03-26 Haiyang Wang , Luca Barletta , Alex Dytso

We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds…

Information Theory · Computer Science 2021-07-13 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Navin Kashyap , Shlomo Shamai

A method is presented for proving upper bounds on the moments of the position operator when the dynamics of quantum wavepackets is governed by a random (possibly correlated) Jacobi matrix. As an application, one obtains sharp upper bounds…

Mathematical Physics · Physics 2016-10-28 Svetlana Jitomirskaya , Hermann Schulz-Baldes
‹ Prev 1 4 5 6 7 8 10 Next ›