相关论文: A Computer Approach to Determine the Densest Trans…

We address the problem, not of the determination -- which usually needs numerical methods -- but of an accurate analytical estimation of the distance of a raw elasticity tensor to cubic symmetry and to orthotropy. We point out that there…

We determine the optimal horoball packing densities for Koszul-type Coxeter simplex tilings in hyperbolic $3$-space. Using a parametrization of horoballs by the Busemann function and the symmetry of the tilings, we obtain families of…

Efficient probability density estimation is a core challenge in statistical machine learning. Tensor-based probabilistic graph methods address interpretability and stability concerns encountered in neural network approaches. However, a…

Tensor networks, which have been traditionally used to simulate many-body physics, have recently gained significant attention in the field of machine learning due to their powerful representation capabilities. In this work, we propose a…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

The sphere packing problem asks for the densest packing of unit balls in d-dimensional Euclidean space. This problem has its roots in geometry, number theory and it is part of Hilbert's 18th problem. In 1958 C. A. Rogers proved a…

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…

The Stoker problem, first formulated in 1968, consists in understanding to what extent a convex polyhedron is determined by its dihedral angles. By means of the double construction, this problem is intimately related to rigidity issues for…

We consider a minimum enclosing and maximum inscribed tropical balls for any given tropical polytope over the tropical projective torus in terms of the tropical metric with the max-plus algebra. We show that we can obtain such tropical…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

A toy model of particles packings is presented, which consists in arranging hexagons on a triangular lattice according to local stability rules. The number of stable packings is analytically computed and found to grow exponentially with the…

We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids, and certain smoothly-shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. E 81, 041310 (2010)]. Here we…

This short note describes the tentative form of a finite-dimensional optimization problem that may be of use in a second-generation proof of the Kepler conjecture. In the original 1998 proof of the Kepler conjecture, the form of the…

Optimal mass transport, also known as the earth mover's problem, is an optimization problem with important applications in various disciplines, including economics, probability theory, fluid dynamics, cosmology and geophysics to cite a few.…

We consider ternary disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each ''hole'' is bounded by three pairwise tangent discs are called triangulated. There are 164 pairs $(r,s)$,…

Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…

We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…