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

In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving networks.

This paper is a sharp and focussed exploration of the Fibonacci substitution and the mathematical entity it gives rise to, the Fibonacci word. Our investigations are both of an algebraic and a geometric nature. Indeed, it is the combination of the two that gives this paper its overall character. The work is in four parts. Chapter 1 is a brisk tour of necessary basics; definitions, key theorems, and a number of techniques subsequently used extensively. A simple one dimensional...

In this paper, we have obtained bounds for the box dimension of graph of harmonic function on the Sierpi\'nski gasket. Also we get upper and lower bounds for the box dimension of graph of functions that belongs to $\text{dom}(\mathcal{E}),$ that is, all finite energy functionals on the Sierpi\'nski gasket. Further, we show the existence of fractal functions in the function space $\text{dom}(\mathcal{E})$ with the help of fractal interpolation functions. Moreover, we provide b...

In this paper we study the integral properties of Apollonian-3 circle packings, which are variants of the standard Apollonian circle packings. Specifically, we study the reduction theory, formulate a local-global conjecture, and prove a density one version of this conjecture. Along the way, we prove a uniform spectral gap for congruence towers of the symmetry group.

A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row, three particles on the third row, etc, and particles on adjacent rows satisfy an interlacing constraint. We consider the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of a fixed size where the particles ...

In this article, we considered a fractal image as a fractal curve, that is, as a walk on a grid in Euclidean space $\R^d$. We placed integers on the generating vectors of a grid, such that opposite directions have opposite numbers. This numbering system converts a curve on that grid into a sequence of integers, corresponding with the curve's edges. The corresponding sequence contains the same fractal structure, i.e., an approximant of the curve corresponds to that of the sequ...

The {\it Sierpi\'nski fractal} or {\it Sierpi\'nski gasket} $\Sigma$ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph $S_n$ derived from the first $n$ iterations of the process that leads to $\Sigma$, and study some of its properties, including its cycle structure, domination number and pebbling number. Various open questions are posed.

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We observe that there exist Apollonian packings which have strong integrality properties, in which all circles in the packing have integer curvatures and rational centers such that (curvature)$\times$(center) is an integer vector. This series of papers explain such properties. A {\em Descartes configuration} is a set of four mutually tange...

The paper concerns the limit shape (under some probability measure) of convex polygonal lines with vertices on $\mathbb{Z}_+^2$, starting at the origin and with the right endpoint $n=(n_1,n_2)\to\infty$. In the case of the uniform measure, an explicit limit shape $\gamma^*:=\{(x_1,x_2)\in\mathbb{R}_+^2\colon \sqrt{1-x_1}+\sqrt{x_2}=1\}$ was found independently by Vershik (1994), B\'ar\'any (1995), and Sinai (1994). Recently, Bogachev and Zarbaliev (2011) proved that the limit...

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon and we have carried out intensive numerical experiments spanning several polygons (the largest number of sides considered here being $16$) and up to $200$ circles ($400$ circles in the special cases of the equilateral triangle and the regu...