Self-similar dendrites with finite boundary and P-sprouts
Metric Geometry
2026-05-13 v1 Combinatorics
Abstract
Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K. The paper shows that the sprout G determines the combinatorial properties of the dendrite K and its topological structure.
Keywords
Cite
@article{arxiv.2605.11833,
title = {Self-similar dendrites with finite boundary and P-sprouts},
author = {Andrei Tetenov and Ivan Yudin and Dmitrii Drozdov},
journal= {arXiv preprint arXiv:2605.11833},
year = {2026}
}
Comments
16 pages, 9 figures