On a subposet of the Tamari lattice
From MaRDI portal
Publication:466873
DOI10.1007/s11083-013-9305-5zbMath1301.06008arXiv1108.5690OpenAlexW3098371085WikidataQ56688562 ScholiaQ56688562MaRDI QIDQ466873
Sebastian A. Csar, Warut Suksompong, Rik Sengupta
Publication date: 31 October 2014
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5690
Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Ordered groups (06F15) Semilattices (06A12)
Related Items (4)
Catalan intervals and uniquely sorted permutations ⋮ Toward a language theoretic proof of the four color theorem ⋮ Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets ⋮ Further bijections to pattern-avoiding valid hook configurations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Toward a language theoretic proof of the four color theorem
- Right-arm rotation distance between binary trees
- Map coloring and the vector cross product
- Tableaux and chains in a new partial order of \(S_ n\)
- A theorem on graphs
- Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
- Enumerating, Ranking and Unranking Binary Trees
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
This page was built for publication: On a subposet of the Tamari lattice