Related papers: Some experiments with integral Apollonian circle p…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
We study the orbit of $\widehat{\mathbb{R}}$ under the M\"obius action of the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$ on $\widehat{\mathbb{C}}$, where $\mathcal{O}_K$ is the ring of integers of an imaginary quadratic field $K$.…
We describe various kaleidoscopic and self-similar aspects of the integral Apollonian gaskets - fractals consisting of close packing of circles with integer curvatures. Self-similar recursive structure of the whole gasket is shown to be…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…
We consider three-dimensional clusters of identical bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for…
We provide the first non-trivial examples of quasi-isometric embeddings between curve complexes. These are induced either by puncturing a closed surface or via orbifold coverings. As a corollary, we give new quasi-isometric embeddings…
A remarkably simple Diophantine quadratic equation is known to generate all Apollonian integral gaskets (disk packings). A new derivation of this formula is presented here based on inversive geometry. Also occurrences of Pythagorean triples…
In this paper, on envelopes created by circle families in the plane, all four basic problems (existence problem, representation problem, problem on the number of envelopes, problem on relationships of definitions) are solved.
The Apollonius problem asks for a sphere tangent to $n+1$ given spheres or hyperplanes in $\mathbb{R}^n$. This problem has been widely studied for an isolated configuration of $n+1$ spheres. In this paper, we study relations among the…
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently,…
We observe two kinds of fractal approximating graphs, the background structures of the generalized Sierpinski Arrowhead Curve independently of the recursive curves. Both graphs related to the generalized Sierpinski Gasket and based on a…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
From the geometric study of the elementary cell of hexagonal circle packings --- a flower of 7 circles --- the class of conformally symmetric circle packings is defined. Up to Moebius transformations, this class is a three parameter family,…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
The traditional Riemann Mapping Theorem can be proved with circle packing techniques. We prove the Combinatorial Riemann Mapping Theorem for tilings of bounded size using circle packings.
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…