Balanced binary trees in the Tamari lattice - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Balanced binary trees in the Tamari lattice

Résumé

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.
Fichier principal
Vignette du fichier
BalTamFPSAC.pdf (406.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00790740 , version 1 (21-02-2013)
hal-00790740 , version 2 (24-08-2015)

Identifiants

  • HAL Id : hal-00790740 , version 1

Citer

Samuele Giraudo. Balanced binary trees in the Tamari lattice. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, United States. pp.596-607. ⟨hal-00790740v1⟩
142 Consultations
719 Téléchargements

Partager

Gmail Facebook X LinkedIn More