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.
Slim Sets of Binary Trees
Some extremal ratios of the distance and subtree problems in binary trees
Labeled Chip-firing on Binary Trees
![QR code for arXiv:1307.0161 [math.CO]](http://oss.arxitics.com/images/favicon.svg)