Intervals of balanced binary trees in the Tamari lattice

DOI10.1016/j.tcs.2011.11.020zbMath1277.68065arXiv1107.3472OpenAlexW2028442244MaRDI QIDQ764359

Samuele Giraudo

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.3472

zbMATH Keywords

posetgenerating seriesgrammarTamari latticebalanced binary treefixed-point functional equation

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Combinatorics of partially ordered sets (06A07) Data structures (68P05)

Related Items (2)

Colored operads, series on colored operads, and combinatorial generating systems ⋮ A Motzkin filter in the Tamari lattice

Uses Software

• SageMath
• OEIS

Cites Work

• The algebra of binary search trees
• Intervals in Catalan lattices and realizers of triangulations
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Hopf algebra of the planar binary trees
• Order structure on the algebra of permutations and of planar binary trees
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• Algebraic and combinatorial structures on Baxter permutations
• Balanced binary trees in the Tamari lattice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intervals of balanced binary trees in the Tamari lattice