Related papers: A method for dense packing discovery
Given the ubiquity of lattice models in physics, it is imperative for researchers to possess robust methods for quantifying clusters on the lattice --- whether they be Ising spins or clumps of molecules. Inspired by biophysical studies, we…
We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…
This paper considers the problem of detecting a high dimensional signal (not necessarily sparse) based on compressed measurements with physical layer secrecy guarantees. First, we propose a collaborative compressive detection (CCD)…
Network analysis has played a key role in knowledge discovery and data mining. In many real-world applications in recent years, we are interested in mining multilayer networks, where we have a number of edge sets called layers, which encode…
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
With a novel 3D discrete-element method specially developed with adhesive contact mechanics, random loose packings of uniform spherical micron-sized particles are fully investigated. The results show that large velocity, large size or weak…
We prove the existence of a solution to an equation governing the number density within a compact domain of a discrete particle system for a prescribed class of particle interactions taking into account the effects of the diffusion and…
We formulate an optimization problem to estimate probability densities in the context of multidimensional problems that are sampled with uneven probability. It considers detector sensitivity as an heterogeneous density and takes advantage…
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…
A new tetrahedral structure model was developed and the geometrical structure of jammed disordered packings of monodisperse spheres with different friction coefficients was systematically characterized. An intrinsic structure feature is…
In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SetCover, SetPacking, and many more. For our investigation, we use the framework of PLS, as defined in…
Sphere packings are essential to the development of physical models for powders, composite materials, and the atomic structure of the liquid state. There is a strong scientific need to be able to assess the fit of packing models to data,…
Accurate quantification of local packing density and mixing in simulations of particulate systems is essential for many industrial applications. Traditional methods which simply count the number of particle centres within a given volume of…
We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
In this two part series, we present a contact model able to capture the response of interacting adhesive elastic-perfectly plastic particles under a variety of loadings. In Part I, we focus on elastic through fully-plastic contact with and…
Image decomposition plays a crucial role in various computer vision tasks, enabling the analysis and manipulation of visual content at a fundamental level. Overlapping images, which occur when multiple objects or scenes partially occlude…
We generalize the particle-conserving dynamics method of de las Heras et al. [J. Phys. Condens. Matter: 28, 24404 (2016).] to binary mixtures and apply this to hard rods in one dimension. Considering the case of one species consisting of…
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…