Related papers: Cavity approach to sphere packing in Hamming space
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…
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)…
This is the sixth 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…
This paper introduces a novel boundary integral approach of shape uncertainty quantification for the Helmholtz scattering problem in the framework of the so-called parametric method. The key idea is to construct an integration grid whose…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
We analyse the asymptotic behaviour of random instances of the Maximum Set Packing (MSP) optimization problem, also known as Maximum Matching or Maximum Strong Independent Set on Hypergraphs. We give an analytical prediction of the MSPs…
Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…
We show that an analogy between crowding in fluid and jammed phases of hard spheres captures the density dependence of the kissing number for a family of numerically generated jammed states. We extend this analogy to jams of mixtures of…
In large scale systems, approximate nearest neighbour search is a crucial algorithm to enable efficient data retrievals. Recently, deep learning-based hashing algorithms have been proposed as a promising paradigm to enable data dependent…
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a…
In order to simulate open quantum systems, many approaches (such as Hamiltonian-based solvers in dynamical mean-field theory) aim for a reproduction of a desired environment spectral density in terms of a discrete set of bath states,…
This paper addresses the inverse problem of qualitatively recovering a clamped cavity in a thin elastic plate using far-field measurements. We present a strengthened analysis of the linear sampling method by carefully examining the range of…
The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…
In this paper we demonstrate a computational method to solve the inverse scattering problem for a star-shaped, smooth, penetrable obstacle in 2D. Our method is based on classical ideas from computational geometry. First, we approximate the…
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…
We obtain an asymptotic formula for the number of circles of curvature at most T in any given bounded Apollonian circle packing. For an integral packing, we obtain the upper bounds for the number of circles with prime curvature as well as…
Ramsey spectroscopy in large, dense ensembles of ultra-cold atoms trapped in optical lattices suffers from dipole-dipole interaction induced shifts and collective superradiance limiting its precision and accuracy. We propose a novel…
The aim of the study presented here was the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed, that the…