Generating binary trees by Glivenko classes on Tamari lattices
type: Item
instance of: scholarly article
title: Generating binary trees by Glivenko classes on Tamari lattices
zbMATH Open document ID: 1181.68318
DOI: 10.1016/S0020-0190(02)00417-9
author: J. Martínez
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5530883
zbMATH Keywords: binary trees
zbMATH Keywords: rotation
zbMATH Keywords: lattices
zbMATH Keywords: Glivenko classes
zbMATH Keywords: algorithms
MaRDI profile type: Publication
cites work: Two families of Newman lattices
cites work: Shellable nonpure complexes and posets. II
cites work: Möbius functions of lattices
cites work: Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
cites work: Finite pseudocomplemented lattices and ``permutoedre''
cites work: Pseudocomplemented semilattices, Boolean algebras, and compatible products
cites work: Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
cites work: Q4165427
cites work: Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
cites work: Q3883535
cites work: Loopless generation of Gray codes for \(k\)-ary trees
cites work: On Rotations and the Generation of Binary Trees
cites work: Primes, irreducibles and extremal lattices
cites work: Enumerating, Ranking and Unranking Binary Trees
cites work: Short notes: Some Properties of the Rotation Lattice of Binary Trees
cites work: An algorithm to compute the möbius function of the rotation lattice of binary trees
cites work: An efficient upper bound of the rotation distance of binary trees
cites work: A Loopless Gray-Code Algorithm for Listing k-ary Trees
cites work: A generalization of Rota's NBC theorem
cites work: A Survey of Combinatorial Gray Codes
cites work: Monoïdes préordonnés et chaînes de Malcev
cites work: On the loopless generation of binary tree sequences
cites work: On generating \(k\)-ary trees in computer representation
full work available at URL: s0020-0190(02)00417-9
OpenAlex ID: W2088934887
Recommended article: On the generation of binary trees inA-order
Recommended article: A note on the generation of binary trees
Recommended article: Q3425593
Recommended article: Q3796773
Recommended article: Generating binary trees by transpositions
Recommended article: The generation of binary trees as a numerical problem
Recommended article: On the generation of binary trees from (0–1) codes
Recommended article: Generating strictly binary trees at random based on convex polygon triangulations
Recommended article: Generating binary trees of bounded height
description: scientific article; zbMATH DE number 5530883