# Elementary fractal geometry. 5. Weak separation is strong separation

arXiv: https://arxiv.org/abs/2404.04892 · HTML: https://mlsanity.com/paper/2404.04892/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 63 references that are in the map.
- First posted on arXiv 7 Apr 2024.

## Abstract (arXiv)

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We show that any finite type self-similar set can be represented as a graph-directed construction obeying the open set condition. The proof is based on a combinatorial algorithm which performed well in computer experiments.