Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the length of arcs in labyrinth fractals

Published 3 Oct 2018 in math.DS, math.GN, and math.GT | (1810.06969v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.