Saved in:
Bibliographic Details
Main Authors: Tetenov, Andrei, Yudin, Ivan, Drozdov, Dmitrii
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.11833
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918534894845952
author Tetenov, Andrei
Yudin, Ivan
Drozdov, Dmitrii
author_facet Tetenov, Andrei
Yudin, Ivan
Drozdov, Dmitrii
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_11833
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Self-similar dendrites with finite boundary and P-sprouts
Tetenov, Andrei
Yudin, Ivan
Drozdov, Dmitrii
Metric Geometry
Combinatorics
28A80
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.
title Self-similar dendrites with finite boundary and P-sprouts
topic Metric Geometry
Combinatorics
28A80
url https://arxiv.org/abs/2605.11833