On the imbalance lattice of path-length sequences of binary trees
classification
🧮 math.CO
keywords
imbalancesequencesbinarylatticelowerpath-lengthtreesbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.