English
Related papers

Related papers: Apollonian Ball Packings and Stacked Polytopes

200 papers

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

Fix two points $p$ and $q$ in the plane and a positive number $k \neq 1$. A result credited to Apollonius of Perga states that the set of points $x$ that satisfy $d(x, p)/d(x, q) = k$ forms a circle. In this paper we study the analogous set…

This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…

Combinatorics · Mathematics 2020-12-11 Leif K. Jorgensen , Guillermo Pineda-Villavicencio , Julien Ugon

We revisit the scaling properties of growing spheres randomly seeded in d=2,3 and 4 dimensions using a mean-field approach. We model the insertion probability without assuming a priori a functional form for the radius distribution. The…

Mathematical Physics · Physics 2023-03-20 Pierre Auclair

We propose a new contact relation between polytopes. Intuitively, we say that two polytopes are in strong contact if a small enough object can pass from one of them to the other while remaining in their union. In the first half of the paper…

Logic · Mathematics 2018-02-23 Tsvetlin Marinov , Tinko Tinchev

Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.

Metric Geometry · Mathematics 2015-11-24 Karoly Bezdek , Balazs Szalkai , Istvan Szalkai

The symmetric group on 4 letters has the reflection group $D_{3}$ as an isomorphic image. This fact follows from the coincidence of the root systems $A_{3}$ and $D_{3}$. The isomorphism is used to construct an orthogonal basis of…

Classical Analysis and ODEs · Mathematics 2008-12-02 Charles F. Dunkl

In this paper we investigate the Alexander polynomial of (1,1)-knots, which are knots lying in a 3-manifold with genus one at most, admitting a particular decomposition. More precisely, we study the connections between the Alexander…

Geometric Topology · Mathematics 2007-05-23 Alessia Cattabriga

Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…

Number Theory · Mathematics 2008-12-08 Nicholas Eriksson , Jeffrey C. Lagarias

Given an equilateral triangle with $a$ the square of its side length and a point in its plane with $b$, $c$, $d$ the squares of the distances from the point to the vertices of the triangle, it can be computed that $a$, $b$, $c$, $d$ satisfy…

Number Theory · Mathematics 2013-03-04 Christina Chen , Nan Li

We show that for every $d$-dimensional polytope, the hypergraph whose nodes are $k$-faces and whose hyperedges are $(k+1)$-faces of the polytope is strongly $(d-k)$-vertex connected, for each $0 \leq k \leq d- 1$.

Combinatorics · Mathematics 2021-07-21 Daniel Hathcock , Josephine Yu

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

Combinatorics · Mathematics 2018-10-02 Mónica Blanco , Francisco Santos

Generalizing a result (the case $k = 1$) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension $2k + 1$ belongs to the generalized Walkup class ${\cal K}_k(2k + 1)$, i.e., all its vertex links are $k$-stacked…

Geometric Topology · Mathematics 2014-01-14 Bhaskar Bagchi , Basudeb Datta

We investigate the collapse of three inelastic particles in dimension $d \geq 2$. We obtain general results of convergence and asymptotics concerning the variables of the dynamical system describing a collapsing system of particles. We…

Mathematical Physics · Physics 2025-10-09 Théophile Dolmaire , Juan J. L. Velázquez

The main goal of this paper is to show that shellability is NP-hard for triangulated d-balls (this also gives hardness for triangulated d-manifolds/d-pseudomanifolds with boundary) as soon as d is at least 3. This extends our earlier work…

Computational Geometry · Computer Science 2024-07-26 Pavel Paták , Martin Tancer

This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…

Metric Geometry · Mathematics 2016-11-26 Marzena Szajewska

Inspired by a question of Sarnak, we introduce the notion of a prime component in an Apollonian circle packing: a maximal tangency-connected subset having all prime curvatures. We also consider thickened prime components, which are…

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

Given an undirected graph $G = (V,E)$, the cut polytope $\mathrm{CUT}(G)$ is defined as the convex hull of the incidence vectors of all cuts in $G$. The 1-skeleton of $\mathrm{CUT}(G)$ is a graph whose vertex set is the vertex set of the…

Combinatorics · Mathematics 2024-06-27 Andrei V. Nikolaev

A link in the 3-sphere is homotopically trivial, according to Milnor, if its components bound disjoint maps of disks in the 4-ball. This paper concerns the question of what spaces give rise to the same class of homotopically trivial links…

Geometric Topology · Mathematics 2010-10-15 Vyacheslav Krushkal