Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On a Subposet of the ...
Conference paper

On a Subposet of the Tamari Lattice

Sebastian A. Csar (1), Rik Sengupta (2), Warut Suksompong (3)
(1) School of Mathematics
(2) Department of Mathematics - Princeton University
(3) Department of Mathematics [MIT]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3063
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
1001933
Reflection Group Combinatorics
Indicators
638
Views
975
Downloads

On a Subposet of the Tamari Lattice

Sebastian A. Csar (1), Rik Sengupta (2), Warut Suksompong (3)
(1) School of Mathematics
(2) Department of Mathematics - Princeton University
(3) Department of Mathematics [MIT]
Abstract
English
We discuss some properties of a subposet of the Tamari lattice introduced by Pallo (1986), 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 (1989).
French
Nous discutons d'un subposet du treillis de Tamari introduit par Pallo. Nous appellons ce poset le comb poset. Nous montrons que trois fonctions binaires qui ne se comptent pas bien dans le trellis de Tamari se comptent bien dans un intervalle du comb poset : distance dans le trellis de Tamari, le supremum et l'infimum et les parsewords communs. De plus, nous discutons un rapport entre ce poset et un ordre partiel dans le groupe symétrique étudié par Edelman.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • poset
  • Tamari lattice
  • tree rotation
Cited by

Source: OpenCitations

  • Recursive constructions for the higher Stasheff—Tamari orders in dimension three using the Outer Tamari and Tamari Block posets

    Discrete Mathematics

    Authors : Luke Nelson ORCID, Kevin Treat

    Journal reference : Volume 347, 2023, pp. 113786

    DOI : 10.1016/j.disc.2023.113786
  • Further bijections to pattern-avoiding valid hook configurations

    Advances in Applied Mathematics

    Authors : Maya Sankar ORCID

    Journal reference : Volume 125, 2021, pp. 102152

    DOI : 10.1016/j.aam.2020.102152
  • Catalan intervals and uniquely sorted permutations

    arXiv (Cornell University)

    Authors : Colin Defant ORCID

    Journal reference : Volume 174, 2020, pp. 105250

    DOI : 10.1016/j.jcta.2020.105250
Preview
Loading PDF preview...