English
Related papers

Related papers: Density of Binary Disc Packings: The 9 Compact Pac…

200 papers

A space has $\sigma$-compact tightness if the closures of $\sigma$-compact subsets determines the topology. We consider a dense set variant that we call densely k-separable. We consider the question of whether every densely k-separable…

General Topology · Mathematics 2018-10-12 Alan Dow , Istvan Juhasz

The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…

Statistical Mechanics · Physics 2015-05-18 A. B. Hopkins , F. H. Stillinger , S. Torquato

We use a mock galaxy catalogue based upon the Millennium Run simulation to investigate the intrinsic spatial properties of compact groups of galaxies. We find that approximately 30% of galaxy associations identified in our mock catalogue…

Astrophysics · Physics 2009-11-13 Alan W. McConnachie , Sara L. Ellison , David R. Patton

This study explores the density profile of the stellar disk, radially and azimuthally, based on approximately 8.4 million red clump stars selected from Gaia Bp/Rp spectra. After correcting for selection effects and distance uncertainties,…

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.

Metric Geometry · Mathematics 2017-09-14 Wöden Kusner

Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…

Computational Geometry · Computer Science 2013-11-26 Ivo Vigan

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…

Metric Geometry · Mathematics 2016-08-14 András Bezdek , Włodzimierz Kuperberg

For any delta > 1 we construct a periodic and locally finite packing of the plane with ellipses whose delta-enlargement covers the whole plane. This answers a question of Imre B\'ar\'any. On the other hand, we show that if C is a packing in…

Metric Geometry · Mathematics 2007-05-23 Krystyna Kuperberg , Włodzimierz Kuperberg , Jiří Matoušek , Pavel Valtr

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

This work analyzes the distribution and size of interparticle gaps arising in an ensemble of hexagonal unit structures in the xy plane when packing disks with a Gaussian distribution of radii with mean (r) and standard deviation $\Delta r$.…

Statistical Mechanics · Physics 2007-11-29 Daniel P. Snowman

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

It is well known that a graph with $m$ edges can be made triangle-free by removing (slightly less than) $m/2$ edges. On the other hand, there are many classes of graphs which are hard to make triangle-free in the sense that it is necessary…

Combinatorics · Mathematics 2010-09-03 Raphael Yuster

This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…

Metric Geometry · Mathematics 2024-01-30 Ji Hoon Chun , Christian Kipp , Sandro Roch

Brown and Colbourn (1992) showed that the complex roots of the reliability polynomial of connected multigraphs are dense in the unit disk and that the closure of the real roots is $[-1,0] \cup \{1\}$. We prove the simple graph analogues of…

Combinatorics · Mathematics 2026-04-10 Pjotr Buys

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…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

For every convex disk $K$ (a convex compact subset of the plane, with non-void interior), the packing density $\delta(K)$ and covering density $\vartheta(K)$ form an ordered pair of real numbers, {\em i.e.}, a point in ${\mathbb R}^2$. The…

Metric Geometry · Mathematics 2013-09-03 Włodzimierz Kuperberg

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…

Soft Condensed Matter · Physics 2015-06-18 Adil Mughal , Denis Weaire

Radially compact protoplanetary discs (<=50 au) are ubiquitous in nearby star-forming regions. Multiple mechanisms have been invoked to interpret various compact discs. In this paper, we propose that fragmentation of fragile dust grains in…

Earth and Planetary Astrophysics · Physics 2025-02-10 Simin Tong , Richard Alexander

A Bl-packing is a (branched) circle packing that ``properly covers'' the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show…

Complex Variables · Mathematics 2016-09-06 Tomasz Dubejko
‹ Prev 1 3 4 5 6 7 10 Next ›