Related papers: Horofunctions on Sierpi\'nski type triangles
Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.
In this article, we show that $\alpha$-fractal functions defined on Sierpi\'nski gasket (denoted by $\triangle$) depend continuously on the parameters involved in the construction. In the latter part of this article, the continuous…
Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We associate, with every infinite word over a finite alphabet, an increasing sequence of rooted finite graphs, which provide a discrete approximation of the famous Sierpi\'nski carpet fractal. Each of these sequences converges, in the…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
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…
We construct uncountably generated algebras inside the following sets of special functions: Sierpi\'nski-Zygmund functions, perfectly everywhere surjective functions and nowhere continuous Darboux functions. All conclusions obtained in this…
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…
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…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Let M be a geometrically finite hyperbolic 3-manifold whose limit set is a round Sierpi\'nski gasket, i.e. M is geometrically finite and acylindrical with a compact, totally geodesic convex core boundary. In this paper, we classify orbit…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples.…
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…
Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of even or…