Related papers: Packing Disks into Disks with Optimal Worst-Case D…
Random packings of objects of a particular shape are ubiquitous in science and engineering. However, such jammed matter states have eluded any systematic theoretical treatment due to the strong positional and orientational correlations…
We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
We analyze the relationship between the mass of a spherical component and the minimum possible thickness of stable stellar disks. This relationship for real galaxies allows the lower limit on the dark halo mass to be estimated (the thinner…
Recent work on the mass distribution in spiral galaxies, using mainly HI observations, is reviewed. The principal problem is still to determine to what extent the dark matter is important in the inner parts of a galaxy, or in other words,…
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…
We obtain exact densities of contractible and non-contractible loops in the O(1) model on a strip of the square lattice rolled into an infinite cylinder of finite even circumference $L$. They are also equal to the densities of critical…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
This note is the third part of our work devoted to uniqueness sets for spaces of entire functions. Given a discrete set $\Lambda$ with angular density $\Delta$ with respect to the order $\rho$, satisfying some regularity condition, we show…
We consider $O(1)$ dense loop model in a square lattice wrapped on a cylinder of odd circumference $L$ and calculate the exact densities of loops. These densities of loops are equal to the densities of critical bond percolation clusters on…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
An exact description of the complete jamming landscape is developed for a system of hard discs of diameter $\sigma$, confined between two lines separated by a distance $1+\sqrt{3/4} < H/\sigma < 2$. By considering all possible local packing…
We numerically simulate mechanically stable packings of soft-core, frictionless, bidisperse disks in two dimensions, above the jamming packing fraction $\phi_J$. For configurations with a fixed isotropic global stress tensor, we compute the…
Accurate characterization of thick disc properties from recent kinematic and photometric surveys provides converging evidences that this intermediate population is a sequel of the violent heating of early disc populations by a merging…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…