![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV 1107.3472 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.tcs.2011.11.020 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1107.3472
|