English
Related papers

Related papers: Apollonian Ball Packings and Stacked Polytopes

200 papers

A compact circle-packing $P$ of the Euclidean plane is a set of circles which bound mutually disjoint open discs with the property that, for every circle $S\in P$, there exists a maximal indexed set $\{A_{0},\ldots,A_{n-1}\}\subseteq P$ so…

Metric Geometry · Mathematics 2019-07-30 Miek Messerschmidt

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 characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.

Metric Geometry · Mathematics 2011-11-23 Bernd Gonska , Günter M. Ziegler

We describe a construction for d-polytopes generalising the well known stacking operation. The construction is applied to produce 2-simplicial and 2-simple 4-polytopes with g_2=0 on any number of n >= 13 vertices. In particular, this…

Combinatorics · Mathematics 2007-05-23 Andreas Paffenholz , Axel Werner

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

Combinatorics · Mathematics 2015-09-22 Guenter Rote , Francisco Santos , Ileana Streinu

Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…

Combinatorics · Mathematics 2022-12-15 Mladen Kovačević

Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…

Algebraic Geometry · Mathematics 2015-06-08 Elena Angelini

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Combinatorics · Mathematics 2023-11-14 Vincent Pilaud , Guillermo Pineda-Villavicencio , Julien Ugon

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

Combinatorics · Mathematics 2023-03-07 Guillermo Pineda-Villavicencio , Julien Ugon

We extend fundamental results concerning Apollonian packings, which constitute a major object of study in number theory, to certain homogeneous sets that arise naturally in complex dynamics and geometric group theory. In particular, we give…

Metric Geometry · Mathematics 2014-02-25 Sergei Merenkov , Maria Sabitova

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

Combinatorics · Mathematics 2023-02-06 Martina Juhnke-Kubitzke , Daniel Köhne

The ball number of a link $L$, denoted by $ball(L)$, is the minimum number of solid balls (not necessarily of the same size) needed to realize a necklace representing $L$. In this paper, we show that $ball(L)\leq 5 cr(L)$ where $cr(L)$…

Combinatorics · Mathematics 2024-01-01 Jorge Luis Ramírez Alfonsín , Ivan Rasskin

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun , Richard Ehrenborg

Some models providing shell-shaped static solutions with compact support (compactons) in 3+1 and 4+1 dimensions are introduced, and the corresponding exact solutions are calculated analytically. These solutions turn out to be topological…

High Energy Physics - Theory · Physics 2015-05-13 C. Adam , P. Klimas , J. Sanchez-Guillen , A. Wereszczynski

The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing…

Metric Geometry · Mathematics 2014-02-05 Karoly Bezdek , Samuel Reid

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

Metric Geometry · Mathematics 2008-03-03 Tom Kennedy

This paper, about a fluid-like system of spatially confined particles, reveals the analytic structure for both, the canonical and grand canonical partition functions. The studied system is inhomogeneously distributed in a region whose…

Statistical Mechanics · Physics 2013-03-15 Ignacio Urrutia

The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…

Classical Analysis and ODEs · Mathematics 2016-02-24 Clotilde Martínez , Miguel A. Piñar

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

Geometric Topology · Mathematics 2012-01-31 Bhaskar Bagchi , Basudeb Datta

We consider the problem of finding the maximum number $e_d(n)$ of pairs of touching circles in a packing of $n$ congruent circles of diameter $d$ in the hyperbolic plane of curvature $-1$. In the Euclidean plane, the maximum comes from a…

Combinatorics · Mathematics 2026-01-01 Ádám Sagmeister , Konrad J. Swanepoel