Related papers: Upper bounds on packing density for circular cylin…
We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
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…
The `maximum' disk hypothesis of galactic disks imbedded in dark matter halos is examined. First, decompositions of the rotation curves of NGC 2613, 3198, 6503, and 7184 are analyzed. For these galaxies the radial velocity dispersions of…
Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…
We use current observations on the number statistics of gravitationally lensed optical arcs towards galaxy clusters to derive an upper limit on the cosmological mass density of the Universe. The gravitational lensing statistics due to…
We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…
Bounds for the diameter and for the expansion of long-range percolation clusters on the cycle $\Z / N\Z$ are given.
We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…
We prove the infinitesimal rigidity of some geometrically infinite hyperbolic 4- and 5-manifolds. These examples arise as infinite cyclic coverings of finite-volume hyperbolic manifolds obtained by colouring right-angled polytopes, already…
For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $\lambda\geq 1$, the critical covering area $A^*(\lambda)$ is the…
In 2004, Bowers-Stephenson [2] introduced the inversive distance circle packings as a natural generalization of Thurston's circle packings. They further conjectured the rigidity of infinite inversive distance circle packings in the plane.…
We consider the effective surface motion of a particle that freely diffuses in the bulk and intermittently binds to that surface. From an exact approach we derive various regimes of the effective surface motion characterized by physical…
This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…
In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere…
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…
In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…