Distances in Sierpiński graphs and on the Sierpiński gasket

The well known planar fractal called the Sierpiński gasket can be defined with the help of a related sequence of graphs {G _n } _{n ≥ 0}, where G _n is the n-th Sierpiński graph, embedded in the Euclidean plane. In the present paper we prove geometric criteria that allow us to decide, whether a shortest path between two distinct vertices x and y in G _n , that lie in two neighbouring elementary triangles (of the same level), goes through the common vertex of the triangles or through two distinct vertices (both distinct from the common vertex) of those triangles. We also show criteria for the analogous problem on the planar Sierpiński gasket and in the 3-dimensional Euclidean space.     

The average distance on the Sierpiński gasket

Summary The canonical distance of points on the Sierpiski gasket is considered and its expectation deduced. The solution is surprising, both for the value and for the method derived from an analysis of graphs connected with the Tower of Hanoi problem.     

Equidistribution and Brownian motion on the Sierpiński gasket

We introduce several concepts of discrepancy for sequences on the Sierpiski gasket. Furthermore a law of iterated logarithm for the discrepancy of trajectories of Brownian motion is proved. The main tools for this result are regularity properties of the heat kernel on the Sierpiski gasket. Some of the results can be generalized to arbitrary nested fractals in the sense of T. Lindstrøm.With 2 FiguresDedicated to Prof. Edmund Hlawka on the occasion of his 80^th birthdayThe authors are supported by the Austrian Science Foundation project Nr. P10223-PHY and by the Austrian-Italian scientific cooperation program project Nr. 39     

Harmonic analysis on the Sierpiński gasket and singular functions

We study the restriction on [0,1] of harmonic functions on the Sierpiński gasket, proving they are singular functions whenever they are monotone. We show that their derivatives are zero or infinity on certain non-denumerable sets. Finally, we show they are among a wider class of functions that contains some already known and studied functions.     

Saddle-point solutions to Dirichlet problems on the Sierpiński gasket

We provide sufficient conditions for the existence of saddle-point solutions to a system driven by the weak Laplacian on the Sierpiński gasket. We analyze also its stability by proving its continuous dependence on parameters.     

Multiple solutions for a class of nonlinear elliptic equations on the Sierpiński gasket

This paper investigates a class of nonlinear elliptic equations on a fractal domain. We establish a strong Sobolev-type inequality which leads to the existence of multiple non-trivial solutions of Δu +c(x)u =f(x,u), with zero Dirichlet boundary conditions on the Sierpiski gasket. Our existence results do not require any growth conditions off(x, t) in t, in contrast to the classical theory of elliptic equations on smooth domains.     

Lifschitz singularity for subordinate Brownian motions in presence of the Poissonian potential on the Sierpiński gasket

We establish the Lifschitz-type singularity around the bottom of the spectrum for the integrated density of states for a class of subordinate Brownian motions in presence of the nonnegative Poissonian random potentials, possibly of infinite range, on the Sierpiński gasket. We also study the long-time behaviour for the corresponding averaged Feynman–Kac functionals.     

Szegö Limit Theorems on the Sierpiński Gasket

We use the existence of localized eigenfunctions of the Laplacian on the Sierpiński gasket (SG) to formulate and prove analogues of the strong Szegö limit theorem in this fractal setting. Furthermore, we recast some of our results in terms of equally distributed sequences.     

On dynamics of the Sierpiński carpet

We prove that the Sierpiński curve admits a homeomorphism with strong mixing properties. We also prove that the constructed example does not have Bowen's specification property.     

Connected generalised Sierpiński carpets

Generalised Sierpiński carpets are planar sets that generalise the well-known Sierpiński carpet and are defined by means of sequences of patterns. We present necessary and sufficient conditions, under which generalised Sierpiński carpets are connected, with respect to Euclidean topology.     

A geometric property of the Sierpiński carpet

The main aim of this paper is to find formulae for the computation of the geodesic metric on the Sierpí nski carpet. This is accomplished by introducing carpet coordinates. Subsequently we show the equivalence of the Euclidean and the geodesic metric on this fractal.     

Uniformization of Sierpiński carpets in the plane

Let S _i , i∈I, be a countable collection of Jordan curves in the extended complex plane \(\widehat{\mathbb{C}}\) that bound pairwise disjoint closed Jordan regions. If the Jordan curves are uniform quasicircles and are uniformly relatively separated, then there exists a quasiconformal map \(f\colon\widehat{\mathbb{C}}\rightarrow\widehat{\mathbb{C}}\) such that f(S _i ) is a round circle for all i∈I. This implies that every Sierpiński carpet in \(\widehat{\mathbb{C}}\) whose peripheral circles are uniformly relatively separated uniform quasicircles can be mapped to a round Sierpiński carpet by a quasisymmetric map.     

A topological characterization of the Sierpiński triangle

We present a topological characterization of the Sierpiński triangle. This answers question 58 from the Problem book of the Open Problem Seminar held at Charles University. In fact we give a characterization of the Apollonian gasket first. Consequently we show that any subcontinuum of the Apollonian gasket, whose boundary consists of three points, is homeomorphic to the Sierpiński triangle.     

Coloring Hanoi and Sierpiński graphs

It is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively. New proofs for their classification with respect to planarity are also given.     

On two theorems of Sierpiński

A theorem of Sierpiński says that every infinite set Q of reals contains an infinite number of disjoint subsets whose outer Lebesgue measure is the same as that of Q. He also has a similar theorem involving Baire property. We give a general theorem of this type and its corollaries, strengthening classical results.     

Resistance in Higher-Dimensional Sierpiński Carpets

We study the effective resistance between disjoint compact sets relative to the n-th level approximation F _n to the generalized Sierpiski carpet in d dimensions. This yields a simple criterion for determining recurrence of simple random walk on the associated pre-fractal graph in terms of the resistance scaling factor.