Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.