# Balanced binary trees in the Tamari lattice

Abstract : We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals $[T_0, T_1]$ where $T_0$ and $T_1$ 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 :
Document type :
Conference papers
Domain :

Cited literature [8 references]

https://hal.inria.fr/hal-00790740
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 3:44:20 PM
Last modification on : Saturday, January 15, 2022 - 3:56:22 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:21:56 AM

### File

dmAN0152.pdf
Publisher files allowed on an open archive

### Citation

Samuele Giraudo. Balanced binary trees in the Tamari lattice. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.725-736, ⟨10.46298/dmtcs.2814⟩. ⟨hal-00790740v2⟩

Record views