Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.06969

On the length of arcs in labyrinth fractals

Ligia L. Cristea·Gunther Leobacher
View original source ↗Read source document ↗Export metadata ↓

Abstract

Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc between any two points in the fractal has infinite length [Cristea\&Steinsky 2009,Cristea\&Steinsky 2011]. In the case of mixed labyrinth fractals a sequence of labyrinth patterns is used in order to construct the dendrite. In the present article we focus on the length of the arcs between points of mixed labyrinth fractals. We show that, depending on the choice of the patterns in the sequence, both situations can occur: the arc between any two points of the fractal has finite length, or the arc between any two points of the fractal has infinite length. This is in stark contrast to the self-similar case.

Explore related subjects

math.DSmath.GNmath.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ligia L. Cristea, Gunther Leobacher. 2018-10-03. On the length of arcs in labyrinth fractals. https://doi.org/10.1007/s00605-017-1056-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗