On the length of arcs in labyrinth fractals (Q1744076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the length of arcs in labyrinth fractals |
scientific article; zbMATH DE number 6860446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the length of arcs in labyrinth fractals |
scientific article; zbMATH DE number 6860446 |
Statements
On the length of arcs in labyrinth fractals (English)
0 references
16 April 2018
0 references
The authors research a special family of Sierpinski carpets defined by means of a sequence of labyrinth patterns. They prove that there are two possible situations: either the length of any arc of that fractal is infinite, or all these arcs have finite lengths.
0 references
fractal
0 references
dendrite
0 references
pattern
0 references
graph
0 references
tree
0 references
path length
0 references
arc length
0 references
0.8588322401046753
0 references
0.8141489624977112
0 references
0.8125554323196411
0 references
0.8040016889572144
0 references
0.8000254034996033
0 references
