English
Related papers

Related papers: On non-parallel cylinder packings

200 papers

In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, $P^2$-irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is…

Geometric Topology · Mathematics 2016-09-07 Robert Myers

A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least…

Combinatorics · Mathematics 2015-05-25 Nevena Francetić , Sarada Herke , Daniel Horsley

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…

Classical Analysis and ODEs · Mathematics 2014-09-30 Michael Hochman

In this paper we have proved several approximation theorems for the family of minimal surfaces in R^3 that imply, among other things, that complete minimal surfaces are dense in the space of all minimal surfaces endowed with the topology of…

Differential Geometry · Mathematics 2007-05-23 A. Alarcon , L. Ferrer , F. Martin

In this paper we prove that no packing of unit balls in Euclidean space $\mathbb{R}^8$ has density greater than that of the $E_8$-lattice packing.

Number Theory · Mathematics 2019-04-15 Maryna Viazovska

We investigate Bayesian nonparametric density estimation via orthogonal polynomial expansions in weighted Sobolev spaces. A core challenge is establishing minimax optimal posterior convergence rates, especially for densities on unbounded…

Statistics Theory · Mathematics 2026-03-20 Yiqi Luo , Xue Luo

It is conjectured that for every convex disks K, the translative covering density of K and the lattice covering density of K are identical. It is well known that this conjecture is true for every centrally symmetric convex disks. For the…

Metric Geometry · Mathematics 2016-01-19 Kirati Sriamorn , Fei Xue

We consider an incompressible fluid in a three-dimensional pipe, following the Navier-Stokes system with classical boundary conditions. We are interested in the following question: is there any optimal shape for the criterion "energy…

Analysis of PDEs · Mathematics 2015-05-13 Antoine Henrot , Yannick Privat

Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic…

Statistical Mechanics · Physics 2010-01-05 Aleksandar Donev , Frank H. Stillinger , P. M. Chaikin , Salvatore Torquato

We develop a simple analytical theory that relates dense sphere packings in a cylinder to corresponding disk packings on its surface. It applies for ratios R=D/d (where d and D are the diameters of the hard spheres and the bounding…

Soft Condensed Matter · Physics 2015-05-20 Adil Mughal , Ho Kei Chan , Denis Weaire

We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…

Mathematical Physics · Physics 2015-05-14 S. Torquato , Y. Jiao

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…

Mathematical Physics · Physics 2021-04-14 A. M. Povolotsky

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…

Soft Condensed Matter · Physics 2013-01-28 Yoav Kallus , Veit Elser

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

Metric Geometry · Mathematics 2020-08-05 Lee-Ad Gottlieb , Aryeh Kontorovich

We discuss in this paper various aspects of the off-critical $O(n)$ model in two dimensions. We find the ground-state energy conjectured by Zamolodchikov for the unitary minimal models, and extend the result to some non-unitary minimal…

High Energy Physics - Theory · Physics 2009-10-22 P. Fendley , H. Saleur

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Combinatorics · Mathematics 2022-11-07 Yulin Chang , Jie Han , Lubos Thoma

Single partially confined collapsed polymers are studied in two dimensions. They are described by self-avoiding random walks with nearest-neighbour attractions below the $\Theta$-point, on the surface of an infinitely long cylinder. For the…

Statistical Mechanics · Physics 2009-11-07 Hsiao-Ping Hsu , Peter Grassberger

We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\varepsilon > 0$ there exists a constant $C_\varepsilon$ such that for any $N$, there are at most $C_\varepsilon$ primes $p \leqslant N$ such…

Number Theory · Mathematics 2017-12-21 Paul Balister , Béla Bollobás , Jonathan D. Lee , Robert Morris , Oliver Riordan

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…

Combinatorics · Mathematics 2007-05-23 Michael Krivelevich , Simon Litsyn , Alexander Vardy