Balanced binary trees in the Tamari lattice
Combinatorics
2010-09-27 v1
Abstract
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and synchronous grammars to get a functional equation of the generating series enumerating balanced tree intervals.
Keywords
Cite
@article{arxiv.1009.4774,
title = {Balanced binary trees in the Tamari lattice},
author = {Samuele Giraudo},
journal= {arXiv preprint arXiv:1009.4774},
year = {2010}
}