Generating binary trees by Glivenko classes on Tamari lattices

Authors:
Jean Pallo
Affiliations:
LE2I, Université de Bourgogne, B.P. 47870, 21078 Dijon Cedex, France
Venue:
Information Processing Letters
Year:
2003

Citing 10
Cited 4

On the rotation distance in the lattice of binary trees

Information Processing Letters
Some properties of the rotation lattice of binary trees

The Computer Journal
Finite pseudocomplemented lattices

European Journal of Combinatorics
Finite pseudocomplemented lattices and “permutoedre”

Discrete Mathematics
On rotations and the generation of binary trees

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
On the loopless generation of binary tree sequences

Information Processing Letters
Loopless generation of Gray codes for k-ary trees

Information Processing Letters
A loopless gray-code algorithm for listing k-ary trees

Journal of Algorithms
On generating k-ary trees in computer representation

Information Processing Letters

The pruning-grafting lattice of binary trees

Theoretical Computer Science
Weak associativity and restricted rotation

Information Processing Letters
Kleene revisited by Suschkewitsch

Acta Cybernetica
Nonassociativity à la Kleene

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Using algebraic-theoretic results, we give an algorithm for generating binary trees within Glivenko classes in Tamari lattices. Tamari lattices are lattices of binary trees endowed by the well-known rotation transformation.