On a subposet of the Tamari lattice

DOI10.1007/S11083-013-9305-5zbMATH Open1301.06008arXiv1108.5690OpenAlexW3098371085WikidataQ56688562 ScholiaQ56688562MaRDI QIDQ466873FDOQ466873

Authors: Sebastian A. Csar, Rik Sengupta, Warut Suksompong 

Publication date: 31 October 2014

Published in: Order (Search for Journal in Brave)

Abstract: We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial order on the symmetric group studied by Edelman.

Full work available at URL: https://arxiv.org/abs/1108.5690

Recommendations

• On a subposet of the Tamari lattice
• Counting smaller trees in the Tamari order
• The enumeration of generalized Tamari intervals
• Balanced binary trees in the Tamari lattice
• Two bijections on Tamari intervals

zbMATH Keywords

semilatticefour color theoremTamari latticecomb poset

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07) Semilattices (06A12) Ordered groups (06F15)

Cites Work

• Toward a language theoretic proof of the four color theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• Map coloring and the vector cross product
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• A theorem on graphs
• Enumerating, Ranking and Unranking Binary Trees
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• Right-arm rotation distance between binary trees
• Tableaux and chains in a new partial order of \(S_ n\)
• Title not available (Why is that?)

Cited In (8)

• Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets
• An extension of Tamari lattices
• The canonical join complex of the Tamari lattice
• Toward a language theoretic proof of the four color theorem
• Exceptional and modern intervals of the Tamari lattice
• On the lattice of subquandles of a Takasaki quandle
• Further bijections to pattern-avoiding valid hook configurations
• Catalan intervals and uniquely sorted permutations

Uses Software

• LOU

This page was built for publication: On a subposet of the Tamari lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466873)