Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures
Helmut Prodinger

TL;DR
This paper explores various specialized tree structures, including Hex-trees and marked ordered trees, analyzing their properties, Horton-Strahler numbers, and asymptotic behaviors, with connections to known integer sequences.
Contribution
It introduces explicit results and asymptotic evaluations for Hex-trees and related structures, expanding understanding of their combinatorial properties.
Findings
Explicit formulas for Horton-Strahler numbers of Hex-trees
Asymptotic evaluations of tree structures
Connections to sequence A002212 in integer sequences
Abstract
Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible. They are augmented by asymptotic evaluations as well. Furthermore, marked ordered trees (in bijection to skew Dyck paths) are investigated, followed 3-Motzkin paths and multi-edge trees. The underlying theme is sequence A002212 in the Encyclopedia of integer sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Random Matrices and Applications · Topological and Geometric Data Analysis
