On the imbalance lattice of path-length sequences of binary trees
Combinatorics
2013-07-02 v1
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.
Keywords
Cite
@article{arxiv.1307.0161,
title = {On the imbalance lattice of path-length sequences of binary trees},
author = {S. Foldes and R. Radeleczki},
journal= {arXiv preprint arXiv:1307.0161},
year = {2013}
}