An algorithm to compute the möbius function of the rotation lattice of binary trees
Publication:3142268
DOI10.1051/ITA/1993270403411zbMATH Open0779.68066OpenAlexW93508501MaRDI QIDQ3142268FDOQ3142268
Author name not available (Why is that?)
Publication date: 15 November 1993
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92455
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Modular lattices, Desarguesian lattices (06C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- A distance metric on binary trees using lattice-theoretic measures
- Enumerating, Ranking and Unranking Binary Trees
- Two families of Newman lattices
- Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- Short notes: Some Properties of the Rotation Lattice of Binary Trees
- A-transformation dans les arbres n-aires
- The Factorization and Representation of Lattices
Cited In (7)
- \(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ball
- The phagocyte lattice of Dyck words
- The pruning-grafting lattice of binary trees
- Generating binary trees by Glivenko classes on Tamari lattices
- Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology
- Shellable nonpure complexes and posets. II
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
This page was built for publication: An algorithm to compute the möbius function of the rotation lattice of binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142268)