On the imbalance lattice of path-length sequences of binary trees

2013/06/29 by Stephan Foldes, S. Foldes, Foldes, S. +2
Computer Science · Engineering · Mathematics · #05 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:05

paper · pdf · doi:10.48550/arxiv.1307.0161

arxiv created 2013/06/29 · openalex publication_date 2013/06/29 · arxiv updated 2013/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that are join-irreducible in the imbalance lattice are characterized.

Related

• Note on islands in path-length sequences of binary trees
• Enumeration of k-Exceedance Lattice Paths with an Application to Comparing Chains of Order Statistics
• The Register Function and Reductions of Binary Trees and Lattice Paths
• A note on limits of sequences of binary trees
• On finite width questionable representations of orders