Single line Apollonian gaskets: is the limit a space filling fractal curve?

A bounded Apollonian circle packing (ACP) is an ancient Greek construction which is made by repeatedly inscribing circles into the triangular interstices in a Descartes configuration of four mutually tangent circles. Remarkably, if the original four circles have integer curvature, all of the circles in the packing will have integer curvature as well. In this paper, we compute a lower bound for the number $\kappa(P,X)$ of integers less than $X$ occurring as curvatures in a bou...

Can you stretch and reform a curve such that it fills a square completely? This question dates back to 18th century, the origin of space-filling curves. It was proved affirmatively by many great mathematicians. In this document, we reconsider the problem and present a different proof using Cartesian product of Fibonacci substitution with itself. Our construction differs from other curves by design.

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 for three-map IFS fractals in general, defined in an Apollonian manner. Following this path, one may discover a broader relationship between polygons and IFS fractals.

In this note, we investigate an infinite one parameter family of circle packings, each with a set of three mutually tangent circles. We use these to generate an infinite set of circle packings with the Apollonian property. That is, every circle in the packing is a member of a cluster of four mutually tangent circles.

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs. These networks have a wide range of applications ranging from the description of force chains in polydisperse granular packings and geometry of fully fragmented porous media, to hierarchical road systems and area-covering electrical supply networks. Some of the properties of these networks, namely, the connectivity expo...

We introduce a new class of fractal circle packings in the plane, generalizing the polyhedral packings defined by Kontorovich and Nakamura. The existence and uniqueness of these packings are guaranteed by infinite versions of the Koebe-Andreev-Thurston theorem. We prove structure theorems giving a complete description of the symmetry groups for these packings. And we give several examples to illustrate their number-theoretic and group-theoretic significance.

We investigate the dimension of intersections of the Sierpi\'nski gasket with lines. Our first main result describes a countable, dense set of angles that are exceptional for Marstrand's theorem. We then provide a multifractal analysis for the set of points in the projection for which the associated slice has a prescribed dimension.

In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic spreading, synchronization, and random walks. As Apollonian networks constitute an interesting family of maximal planar graphs which are simultaneously small-world, scale-free, Euclidean and space filling and highly clustered, the study of t...

We describe a new method to construct Laplacians on fractals using a Peano curve from the circle onto the fractal, extending an idea that has been used in the case of certain Julia sets. The Peano curve allows us to visualize eigenfunctions of the Laplacian by graphing the pullback to the circle. We study in detail three fractals: the pentagasket, the octagasket and the magic carpet. We also use the method for two nonfractal self-similar sets, the torus and the equilateral tr...

A geometrical conclusion: Sierpinski gasket, two Sierpinski gaskets in a line, three Sierpinski gaskets in a line, and four Sierpinski gaskets in a line are self-similar, but five Sierpinski gaskets in a line is not, which is proved in this paper.