• Corpus ID: 14156251

Balanced binary trees in the Tamari lattice

@article{Giraudo2010BalancedBT,
  title={Balanced binary trees in the Tamari lattice},
  author={Samuele Giraudo},
  journal={Discrete Mathematics \& Theoretical Computer Science},
  year={2010},
  pages={725-736}
}
  • Samuele Giraudo
  • Published 24 September 2010
  • Computer Science, Mathematics
  • 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 (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. R´ 

Figures from this paper

Intervals of balanced binary trees in the Tamari lattice
The Dyck pattern poset
Pattern-avoiding Dyck paths
We introduce the notion of $\textit{pattern}$ in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment
Combinatoire algébrique des arbres
Cette these se situe dans le domaine de la combinatoire algebrique et porte sur la construction de plusieurs structures combinatoires et algebriques sur differentes especes d'arbres. Apres avoir

References

SHOWING 1-10 OF 18 REFERENCES
Intervals of balanced binary trees in the Tamari lattice
Combinatorial species and tree-like structures
The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labelled and unlabelled structures and as a tool for the
Generating all trees : history of combinatorial generation
Chapter 7 Combinatorial Searching 1 7.2. Generating All Possibilities 1 7.2.1. Generating Basic Combinatorial Patterns 1 7.2.1.1. Generating all n-tuples 1 7.2.1.2. Generating all permutations 1
Foundations of Computer Science
  • K. Nambiar
  • Philosophy
    Lecture Notes in Computer Science
  • 1997
TLDR
A machine equivalent to Turing machine, that is more intuitive in its working is defined and his incompleteness theorems are proved without using any metalanguage.
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
TLDR
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
TLDR
Volume 4, Fascicle 4This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming, and continues to build a firm foundation for programming.
Introduction to algorithms
TLDR
This article illustrates aspects of programming through a language similar tologo, which turns the computer into a ‘virtual machine’ whose features and capabilities are unlimited.
AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION
TLDR
The organization of information placed in the points of an automatic computer is discussed and the role of memory, storage and retrieval in this regard is discussed.
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
The Art of Computer Programming, Volume III: Sorting and Searching
...
...