Rigidity theorem of graph-directed fractals (Q1717138)

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.