English
Related papers

Related papers: Improved sphere packing lower bounds from Hurwitz …

200 papers

It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…

Number Theory · Mathematics 2024-10-07 Camilla Hollanti , Guillermo Mantilla-Soler , Niklas Miller

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

The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…

Metric Geometry · Mathematics 2012-12-18 Yoav Kallus , Veit Elser , Simon Gravel

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

Combinatorics · Mathematics 2017-10-25 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…

Metric Geometry · Mathematics 2025-05-30 Maximilian Wackenhuth

We investigate the asymptotic behavior, as $N$ grows, of the largest minimal pairwise distance of $N$ points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal…

Mathematical Physics · Physics 2007-05-23 S. V. Borodachov , D. P. Hardin , E. B. Saff

The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…

Materials Science · Physics 2010-01-12 Jozsef Garai

It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…

Metric Geometry · Mathematics 2014-08-05 Yoav Kallus

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…

Number Theory · Mathematics 2020-07-14 Martin Ortiz Ramirez

We improve the range for the discrete Fourier restriction to the four and five dimensional spheres. We rely on two new ingredients, incidence theory and Siegel's mass formula.

Classical Analysis and ODEs · Mathematics 2013-10-22 Jean Bourgain , Ciprian Demeter

Recently Guduru and coworkers have demonstrated with neat theory and experiments that both increase of strength and of toughness are possible in the contact of a rigid sphere with concentric single scale of waviness, against a very soft…

Materials Science · Physics 2016-03-03 M. Ciavarella

This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

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

Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…

Number Theory · Mathematics 2015-08-13 Shantian Cheng

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…

Numerical Analysis · Mathematics 2008-11-04 Andriy V. Bondarenko , Maryna S. Viazovska

In \cite{Sz11} we have generalized the notion of the simplicial density function for horoballs in the extended hyperbolic space $\bar{\mathbf{H}}^n, ~(n \ge 2)$, where we have allowed {\it congruent horoballs in different types} centered at…

Metric Geometry · Mathematics 2011-12-12 Jenő Szirmai

The aim of this paper to determine the locally densest horoball packing arrangements and their densities with respect to fully asymptotic tetrahedra with at least one plane of symmetry in hyperbolic 3-space $\bar{\mathbf{H}}^3$ extended…

Metric Geometry · Mathematics 2016-08-14 Jenő Szirmai

In this article we provide lower bounds for the lower Hausdorff dimension of finite measures assuming certain restrictions on their quaternionic spherical harmonics expansion. This estimate is an analog of a result previously obtained by…

Analysis of PDEs · Mathematics 2022-11-24 Rami Ayoush , Michał Wojciechowski

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…

Metric Geometry · Mathematics 2017-06-19 K. Böröczky , A. Heppes , E. Makai

This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…

Information Theory · Computer Science 2025-07-04 Hugo Beeloo-Sauerbier Couvée , Thomas Jerkovits , Jessica Bariffi
‹ Prev 1 3 4 5 6 7 10 Next ›