On the length of arcs in labyrinth fractals

From MaRDI portal
Publication:1744076

DOI10.1007/S00605-017-1056-8zbMATH Open1391.28008arXiv1810.06969OpenAlexW3098802020WikidataQ59607334 ScholiaQ59607334MaRDI QIDQ1744076FDOQ1744076


Authors: Xianqiang Yang Edit this on Wikidata


Publication date: 16 April 2018

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1810.06969




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On the length of arcs in labyrinth fractals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744076)