English
Related papers

Related papers: Upper bounds on packing density for circular cylin…

200 papers

Surface area and mean width of a cylinder (the convex hull of two parallel disks) in R^3 are computed. It is more difficult to obtain analogous results for a cone (the convex hull of a disk D and a point p). Oblique formulas for mean width,…

Metric Geometry · Mathematics 2013-01-01 Steven R. Finch

In this paper we obtain density estimates for compact surfaces immersed in R^n with total boundary curvature less than 4pi and with sufficiently small L^p norm of the mean curvature, p>2. Our results generalize the main results in [2]. We…

Differential Geometry · Mathematics 2011-05-11 Theodora Bourni , Giuseppe Tinaglia

Effective conductivity of a 2D composite corresponding to the regular hexagonal arrangement of superconducting disks is expressed in the form of a long series in the volume fraction of ideally conducting disks. According to our calculations…

Statistical Mechanics · Physics 2015-08-21 Simon Gluzman , Vladimir Mityushev , Wojciech Nawalaniec , Galina Starushenko

Almost four decades ago, Bergman and Milton independently showed that the isotropic effective electric permittivity of a two-phase composite material with a given volume fraction is constrained to lie within lens-shaped regions in the…

Applied Physics · Physics 2023-12-12 Christian Kern , Owen D. Miller , Graeme W. Milton

It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…

Classical Analysis and ODEs · Mathematics 2025-03-27 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…

Soft Condensed Matter · Physics 2016-05-05 Yoav Kallus

We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…

Metric Geometry · Mathematics 2018-07-11 Lewis Bowen , Charles Holton , Charles Radin , Lorenzo Sadun

An efficient method is developed which allows the calculation of distributions of the surface density in the equilibrium disk configurations with an isolated point mass at the center corresponding to known distributions of the angular…

Astrophysics · Physics 2009-11-07 N. R. Sibgatullin , A. Garcia , V. S. Manko

The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the alpha-x plane of sphere radius ratio alpha and relative concentration x are at the Kepler limit alpha = 1,…

Statistical Mechanics · Physics 2015-05-30 Adam B. Hopkins , Yang Jiao , Frank H. Stillinger , Salvatore Torquato

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

Metric Geometry · Mathematics 2026-04-24 Fernando Mário de Oliveira Filho , Andreas Spomer , Frank Vallentin

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Computational Geometry · Computer Science 2015-03-30 Milos Tatarevic

Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has…

Classical Analysis and ODEs · Mathematics 2022-10-05 Steven Maio , Dimitrios Ntalampekos

In 1967, Moon and Moser proved a tight bound on the critical density of squares in squares: any set of squares with a total area of at most 1/2 can be packed into a unit square, which is tight. The proof requires full knowledge of the set,…

Discrete Mathematics · Computer Science 2017-01-03 Sándor P. Fekete , Hella-Franziska Hoffmann

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

We investigate the stability of circular material orbits in the analytic galactic metric recently derived by Harko \textit{et al.} (2014). It turnsout that stability depends more strongly on the dark matter central density $%\rho_{0}$ than…

General Relativity and Quantum Cosmology · Physics 2015-06-15 Ramil Izmailov , Alexander A. Potapov , Alexander I. Filippov , Mithun Ghosh , Kamal K. Nandi

The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…

Statistical Mechanics · Physics 2013-05-29 Adam B. Hopkins , Frank H. Stillinger , Salvatore Torquato

In this article a multilayer parking system with screening of size n=3 is studied with a focus on the time-dependent particle density. We prove that the asymptotic limit of the particle density increases from an average density of 1/3 on…

Probability · Mathematics 2015-08-24 Sjoert Fleurke , Aernout C. D. van Enter

In 1976 D. Sullivan gave an example of a flow on a compact manifold such that each one of its orbits is a circle and with the surprising property that there is no finite upper bound for their length. The aim of this article is to show that…

Dynamical Systems · Mathematics 2014-06-25 Pablo D. Carrasco

In earlier works \cite{Sz06-1}, \cite{Sz06-2}, \cite{Sz13-3} and \cite{Sz13-4} we have investigated the densest packings and the least dense coverings by congruent hyperballs (hyperspheres) to the regular prism tilings in $n$-dimensional…

Metric Geometry · Mathematics 2016-03-04 Jenö Szirmai

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…

Combinatorics · Mathematics 2007-05-23 Robert B. Ellis