Related papers: Dense packings of hard circular arcs
The study of hard-particle packings is of fundamental importance in physics, chemistry, cell biology, and discrete geometry. Much of the previous work on hard-particle packings concerns their densest possible arrangements. By contrast, we…
Using a Lubachevsky-Stillinger-like growth algorithm combined with biased SWAP Monte Carlo and transient degrees of freedom, we generate ultradense disordered jammed ellipse packings. For all aspect ratios $\alpha$, these packings exhibit…
It has been known for almost 200 years that some angles cannot be trisected by straightedge and compass alone. This paper studies the set of such angles as well as its complement $\mathcal{T}$, both regarded as subsets of the unit circle…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
Small heavy particles cannot get attracted into a region of closed streamlines in a non-accelerating frame (Sapsis & Haller 2010). In a rotating system, however, particles can get trapped (Angilella 2010) near vortices. We perform numerical…
We calculate the configurational entropy of hard particles confined in a cavity using Monte Carlo integration. Multiple combinations of particle and cavity shapes are considered. For small numbers of particles $N$, we show that the entropy…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
We study metric measure spaces that admit "thick" families of rectifiable curves or curve fragments, in the form of Alberti representations or curve families of positive modulus. We show that such spaces cannot be bi-Lipschitz embedded into…
We have previously explored cylindrical packings of disks and their relation to sphere packings. Here we extend the analytical treatment of disk packings, analysing the rules for phyllotactic indices of related structures and the variation…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…
We consider 3-dimensional hyperbolic cone-manifolds, singular along infinite lines, which are ``convex co-compact'' in a natural sense. We prove an infinitesimal rigidity statement when the angle around the singular lines is less than…
The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In \cite{Sz13-1} we defined and described the {\it regular infinite or bounded} $p$-gonal prism tilings in $\SLR$ space. We proved that there exist infinitely many regular infinite $p$-gonal face-to-face prism tilings $\cT^i_p(q)$ and…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…