Related papers: A computer verification of the Kepler conjecture

Kernel density estimation is a convenient way to estimate the probability density of a distribution given the sample of data points. However, it has certain drawbacks: proper description of the density using narrow kernels needs large data…

For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved hexagonal packings". The curved hexagonal packing of 7 disks…

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…

High-multiplicity Kepler systems (referred to as Kepler multis) are often tightly packed and may be on the verge of instability. Many systems of this type could have experienced past instabilities, where the compact orbits and often low…

The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…

We prove the convergence of a particle method for the approximation of diffusive gradient flows in one dimension. This method relies on the discretisation of the energy via non-overlapping balls centred at the particles and preserves the…

We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…

Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum…

The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted area with minimum weighted perimeter. According to Chambers' recent proof of the Log Convex Density Conjecture, for many densities on $\mathbb{R}^n$…

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…

The note shows an easy way to improve E.H. Smith's packing density bound in $\mathbb{R}^3$ from $0.53835...$ to $0.54755...$ .

Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…

Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence…

Dense, disordered packings of particles are useful models of low-temperature amorphous phases of matter, biological systems, granular media, and colloidal systems. The study of dense packings of nonspherical particles enables one to…

Gaussian noise stability results have recently played an important role in proving results in hardness of approximation in computer science and in the study of voting schemes in social choice. We prove a new Gaussian noise stability result…

Recently, a density result for the $16$-rank of $\text{Cl}(\mathbb{Q}(\sqrt{-p}))$ was established when $p$ varies among the prime numbers, assuming a short character sum conjecture. In this paper we prove the same density result…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

We prove the High Girth Existence Conjecture - the common generalization of the Existence Conjecture for Combinatorial Designs originating from the 1800s and Erd\H{o}s' Conjecture from 1973 on the Existence of High Girth Steiner Triple…