Supermixed labyrinth fractals (Q785246)

One can begin with the authors' abstract: ``Labyrinth fractals are dendrites in the unit square. They were introduced and studied in the last decade first in the self-similar case, then in the mixed case. Supermixed fractals constitute a significant generalisation of mixed labyrinth fractals: each step of the iterative construction is done according to not just one labyrinth pattern, but possibly to several different patterns. In this paper we introduce and study supermixed labyrinth fractals and the corresponding prefractals, called supermixed labyrinth sets, with focus on the aspects that were previously studied for the self-similar and mixed case: topological properties and properties of the arcs between points in the fractal. The facts and formulae found here extend results proven in the above mentioned cases. One of the main results is a sufficient condition for infinite length of arcs in mixed labyrinth fractals.'' A survey in this paper is devoted to labyrinth fractals and their applications. The concepts of supermixed labyrinth sets and fractals and also a concept specific to supermixed labyrinth fractals, are introduced. The notions of exits of supermixed labyrinth fractals and of squares of a given level are defined. The concept of blocked labyrinth pattern, the definition of the path matrix of a labyrinth pattern, and properties of the path matrix of blocked labyrinth patterns, are recalled. Also, counting matrices are defined. It is proven that supermixed labyrinth sets are labyrinth patterns. The result that every mixed labyrinth fractal is a dendrite, is extended to the case of supermixed labyrinth fractals. Relations between path matrices of labyrinth patterns, supermixed labyrinth sets of some level and the counting matrices, are described. A connection between paths in supermixed labyrinth sets and arcs in labyrinth fractals is established. A sufficient condition for the infinite length of any arc in a mixed labyrinth fractal is presented.