Related papers: Relaxed Disk Packing
We study dense packings of disks and related Gibbs distributions representing high-density phases in the hard-core model on unit triangular, honeycomb and square lattices. The model is characterized by a Euclidean exclusion distance $D>0$…
We consider discretized gravity in six dimensions, where the two extra dimensions have been compactified on a hyperbolic disk of constant curvature. We analyze different realizations of lattice gravity on the disk at the level of an…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
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)$,…
In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.
I use N-body simulations with two mass species of particles to demonstrate that disk galaxy simulations are subject to collisional relaxation at a higher rate than is widely assumed. Relaxation affects the vertical thickness of the disk…
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random…
We present a study focusing on the nature of compact groups through the study of their elliptical galaxies. We determine velocity dispersions ($\sigma$) for 18 18 bright elliptical galaxies located in the core of Hickson compact groups and…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
We prove that uniformly random packings of copies of a certain simply-connected figure in the plane exhibit global connectedness at all sufficiently high densities, but not at low densities.
Based on numerical simulations that we have carried out, we provide evidence that for regular polygons with $\sigma= 6j$ sides (with $j=2,3,\dots$), $N(k)=3 k (k+1)+1$ (with $k=1,2,\dots$) congruent disks of appropriate size can be nicely…
We analyse properties of contact networks formed in packings of soft frictionless disks near the unjamming transition. We construct polygonal tilings and triangulations of the contact network that partitions space into convex regions which…
We prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…
In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard…
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…
Dependence of structural self-organization of granular materials on preparation and grain parameters is key to predictive modelling. We study 60 different mechanically equilibrated polydisperse disc packs, generated numerically by two…