Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Balanced binary tree ...
Conference paper

Balanced binary trees in the Tamari lattice

Samuele Giraudo ORCID (1)
(1) Laboratoire d'Informatique Gaspard-Monge
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Proceedings
DOI
10.46298/dmtcs.2814
License
https://about.hal.science/hal-authorisation-v1
Indicators
566
Views
522
Downloads

Balanced binary trees in the Tamari lattice

Samuele Giraudo ORCID (1)
(1) Laboratoire d'Informatique Gaspard-Monge
Abstract
English
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.
French
Nous montrons que l'ensemble des arbres équilibrés est clos par intervalle dans le treillis de Tamari. Nous caractérisons la forme des intervalles du type $[T_0, T_1]$ où $T_0$ et $T_1$ sont équilibrés en montrant qu'en tant qu'ensembles partiellement ordonnés, ils sont isomorphes à un hypercube. Nous introduisons la notion de motif d'arbre et de grammaire synchrone dans le but d'établir une équation fonctionnelle de la série génératrice qui dénombre les intervalles d'arbres équilibrés.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • balanced trees
  • Tamari lattice
  • posets
  • grammars
  • generating series
  • combinatorics
Cited by

Source: OpenCitations

  • The Dyck pattern poset

    Discrete Mathematics

    Authors : Axel Bacher ORCID, Antonio Bernini ORCID, Luca Ferrari ORCID, Benjamin Gunby ORCID, Renzo Pinzani, Julian West

    Journal reference : Volume 321, 2014, pp. 12-23

    DOI : 10.1016/j.disc.2013.12.011
Preview
Loading PDF preview...