Rigidity theorem of graph-directed fractals
From MaRDI portal
Abstract: In this paper, we identify two fractals if and only if they are biLipschitz equivalent. Fix ratio for dust-like graph-directed sets with ratio and integer characteristics, we show that they are rigid in the sense that they are uniquely determined by their Hausdorff dimensions. Using this rigidity theorem, we show that in some class of self-similar sets, two totally disconnected self-similar sets without complete overlaps are biLipschitz equivalent.
The authors obtain a rigid theorem for dust-like graph-directed sets with integer characteristic, saying that the latter sets are uniquely determined by their Hausdorff dimension in the sense of bilipschitz equivalence. Using this result, they show that, in a suitable class of self-similar sets, two totally disconnected self-similar sets without complete overlaps are bilipschitz equivalent. They also provide an algorithm to test complete overlaps in polynomial time.
Recommendations
- Geometric rigidity of a class of fractal sets
- Rigidity, Graphs and Hausdorff Dimension
- Lipschitz equivalence of graph-directed fractals
- scientific article; zbMATH DE number 437616
- Hodge-de Rham theory on fractal graphs and fractals
- The rigidity of infinite graphs
- On multifractal rigidity
- Total i̇rregulari̇ty of fractal graphs
- scientific article; zbMATH DE number 1864684
- On Graph Directed Constructions Of Fractals
Cited in
(5)
This page was built for publication: Rigidity theorem of graph-directed fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717138)
