Related papers: Apollonian Ball Packings and Stacked Polytopes

We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

We investigate the plane dynamical system given by the secant map applied to a polynomial $p$ having at least one multiple root of multiplicity $d>1$. We prove that the local dynamics around the fixed points associated to the roots of $p$…

Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron if and only if, $G$ is simple, plane and $3$-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections…

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…

We obtain an asymptotic formula for the number of circles of curvature at most T in any given bounded Apollonian circle packing. For an integral packing, we obtain the upper bounds for the number of circles with prime curvature as well as…

The matching polytope of a graph $G$ is the convex hull of the indicator vectors of the matchings on $G$. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes…

The Apollonian packings (APs) are fractals that result from a space-filling procedure with spheres. We discuss the finite size effects for finite intervals $s\in[s_\mathrm{min},s_\mathrm{max}]$ between the largest and the smallest sizes of…

A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…

The force network of a granular assembly, defined by the contact network and the corresponding contact forces, carries valuable information about the state of the packing. Simple analysis of these networks based on the distribution of force…

Kalai conjectured that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $d-1$, then the graph of $P$ and the space of affine $2$-stresses of $P$ determine $P$ up to affine equivalence. We propose a…

A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree…

We study non-topological solitons, so called Q-balls, which carry a non-vanishing Noether charge and arise as lump solutions of self-interacting complex scalar field models. Explicit examples of new axially symmetric non-spinning Q-ball…

We are interested in algebraic properties of empty lattice simplices $\Delta$, that is, $d$-dimensional lattice polytopes containing exactly $d+1$ points of the integer lattice $\mathbb{Z}^d$. The cyclicity rank of $\Delta$ is the minimal…

An external load on a particle packing is distributed internally through a heterogeneous network of particle contacts. This contact force distribution determines the stability of the particle packing and the resulting structure. Here, we…

A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…

The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly-connected ``links'' and multiply-connected ``blobs.'' Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block…