Related papers: Apollonian Ball Packings and Stacked Polytopes
We investigate the presence of topological twistons in crystalline polyethylene. We describe crystalline polyethylene with a model that couples the torsional and longitudinal degrees of freedom of the polymeric chain by means of a system of…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
We ask which degree sequences admit a unique realisation as a $3$-polytopal graph (polyhedron) on $p$ vertices. We give an exhaustive list of these sequences for the case where one degree equals $p-1$ and exactly two or three of them equal…
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…
By correcting an example by Polyanskii, we show that there exist reduced polytopes in three-dimensional Euclidean space. This partially answers the question posed by Lassak on the existence of reduced polytopes in $d$-dimensional Euclidean…
In this paper we study the operation of cutting off edges of a simple $3$-polytope $P$ along the graph $\Gamma$. We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of…
This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…
Euclidean triangles and IFS fractals seem to be disparate geometrical concepts, unless we consider the Sierpi\'{n}ski gasket, which is a self-similar collection of triangles. The "circumcircle" hints at a direct link, as it can be derived…
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
Inspired by, and using methods of optimization derived from classical three dimensional electrostatics, we note a novel beautiful symmetric four dimensional polytope we have found with 80 vertices. We also describe how the method used to…
Apollonian gaskets are formed by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We experimentally study the pair correlation, electrostatic energy, and nearest neighbor spacing of…
We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…
A circle of curvature $n\in\mathbb{Z}^+$ is a part of finitely many primitive integral Apollonian circle packings. Each such packing has a circle of minimal curvature $-c\leq 0$, and we study the distribution of $c/n$ across all primitive…
Static packings of perfectly rigid particles are investigated theoretically and numerically. The problem of finding the contact forces in such packings is formulated mathematically. Letting the values of the contact forces define a vector…
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…
A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
We construct a family of PL triangulations of the $d$-dimensional real projective space $\mathbb{R}P^d$ on $\Theta((\frac{1+\sqrt{5}}{2})^{d+1})$ vertices for every $d\geq 1$. This improves a construction due to K\"{u}hnel on $2^{d+1}-1$…
We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…