Related papers: Density of triangulated ternary disc packings
Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis,…
We present the first results of a systematic analysis of radially truncated exponential discs for four galaxies of a complete sample of disc-dominated edge-on spiral galaxies. The discs of our sample galaxies are truncated at similar radii…
We give a complete classification of self-dual completely regular codes with covering radius $\rho \leq 3$. For $\rho=1$ the results are almost trivial. For $\rho=2$, by using properties of the more general class of uniformly packed codes…
The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open,…
We provide a counterexample to a conjecture by B. Connelly about density of circle packings
Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…
Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic…
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
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…
Since antiquity, the packing of convex shapes has been of great interest to many scientists and mathematicians. Recently, particular interest has been given to packings of three-dimensional tetrahedra. Dense packings of both crystalline and…
A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…
A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…
We obtain a new lower bound on the radius of the largest ball of separable unnormalized states around the identity matrix for a 3-qubit system. This also enables us to improve the corresponding lower bounds for multi-qubit systems. These…
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
Though about 80 pulsar binaries have been detected in globular clusters so far, no pulsar has been found in a triple system in which all three objects are of comparable mass. Here we present predictions for the abundance of such triple…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Given a set of $n$ nonoverlapping circular discs on a plane, we aim to determine possible positions of points (referred to as cameras) that could fully illuminate all the circular discs' boundaries. This work presents a geometric approach…
We measure the projected half-light radii of young star clusters in 31 galaxies from the Legacy Extragalactic UV Survey (LEGUS). We implement a custom pipeline specifically designed to be robust against contamination, which allows us to…
We present numerical simulations that allow us to compute the number of ways in which $N$ particles can pack into a given volume $V$. Our technique modifies the method of Xu et al. (Phys. Rev. Lett. 106, 245502 (2011)) and outperforms…
Random packings of granular chains are presented as a model polymer system to investigate the contribution of entanglements to strain-stiffening in the absence of Brownian motion. The chain packings are sheared in triaxial compression…