A note on limits of sequences of binary trees

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the set of possible limits and its structure as a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete mathematics and theoretical computer science Ročník 25:1; číslo Analysis of Algorithms; s. 1 - 15
Hlavný autor:	Grübel, Rudolf
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Predmet:	05c05, 60c05, 68w40 mathematics - combinatorics mathematics - probability Metric space Normality Permutations Search algorithms Set theory Sorting algorithms Topology Trees (mathematics)
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!