相关论文: Optimal Packing Behavior of some 2-block Patterns
Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…
Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this…
We bound several quantities related to the packing density of the patterns 1(L+1)L...2. These bounds sharpen results of B\'ona, Sagan, and Vatter and give a new proof of the packing density of these patterns, originally computed by…
We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…
A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if $\sigma$ is a layered permutation, then the density of $\sigma$ in a permutation of order $n$ is maximized by a layered permutation. Albert,…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
We introduce a model for particles that are extremely polydisperse in size compared to monodisperse and bidisperse systems. In two dimensions (2D), size polydispersity inhibits crystallization and increases packing fraction at jamming…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…
In 1900, as a part of his 18th problem, Hilbert proposed the question to determine the densest congruent (or translative) packings of a given solid, such as the unit ball or the regular tetrahedron of unit edges. Up to now, our knowledge…
We construct the densest known two-dimensional packings of superdisks in the plane whose shapes are defined by |x^(2p) + y^(2p)| <= 1, which contains both convex-shaped particles (p > 0.5, with the circular-disk case p = 1) and…
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…
The amount of information propagated by an intermediate heavy particle exhibits characteristic features in inelastic scatterings with $n\geq 3$ final particles. As the total energy increases, the entanglement entropy, between its decay…
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and…
Heterogeneity is classified in five categories---topologic, geometric, kinematic, static, and constitutive---and the first four categories are investigated in a numerical DEM simulation of biaxial compression. The simulation experiments…