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. The $m$-Cover Posets ...
Conference paper

The $m$-Cover Posets and the Strip-Decomposition of $m$-Dyck Paths

Myrto Kallipoliti ORCID (1), Henri Mühle (1)
(1) Fakultät für Mathematik [Wien]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2409
License
https://about.hal.science/hal-authorisation-v1
Z 130
Indicators
746
Views
719
Downloads

The $m$-Cover Posets and the Strip-Decomposition of $m$-Dyck Paths

Myrto Kallipoliti ORCID (1), Henri Mühle (1)
(1) Fakultät für Mathematik [Wien]
Abstract
English
In the first part of this article we present a realization of the $m$-Tamari lattice $\mathcal{T}_n^{(m)}$ in terms of $m$-tuples of Dyck paths of height $n$, equipped with componentwise rotation order. For that, we define the $m$-cover poset $\mathcal{P}^{\langle m \rangle}$ of an arbitrary bounded poset $\mathcal{P}$, and show that the smallest lattice completion of the $m$-cover poset of the Tamari lattice $\mathcal{T}_n$ is isomorphic to the $m$-Tamari lattice $\mathcal{T}_n^{(m)}$. A crucial tool for the proof of this isomorphism is a decomposition of $m$-Dyck paths into $m$-tuples of classical Dyck paths, which we call the strip-decomposition. Subsequently, we characterize the cases where the $m$-cover poset of an arbitrary poset is a lattice. Finally, we show that the $m$-cover poset of the Cambrian lattice of the dihedral group is a trim lattice with cardinality equal to the generalized Fuss-Catalan number of the dihedral group.
French
Dans la première partie de cet article nous présentons une réalisation du treillis $m$ -Tamari $\mathcal{T}_n^{(m)}$ à l’aide de $m$-uplets de chemins de Dyck de hauteur $n$, équipés de l’ordre de rotation composante par composante. Pour cela, nous définissons le poset de $m$-couverture $\mathcal{P}^{\langle m \rangle}$ d’un poset borné quelconque $\mathcal{P}$, et montrons que la plus petite complétion en treillis du poset de $m$-couverture du treillis de Tamari $\mathcal{T}_n$ est isomorphe au treillis $m$-Tamari $\mathcal{T}_n^{(m)}$. Unoutil crucial pour la preuve de cet isomorphisme est une décomposition des chemins $m$-Dyck en $m$-uplets de chemins de Dyck usuels, que nous appelons la décomposition en bandes. Par la suite, nous caractérisons les cas où le poset de $m$-couverture d’un poset donné est un treillis. Enfin nous montrons que le poset de $m$-couverture du treillis Cambrien du groupe diédral est un treillis svelte de cardinalité le nombre généralisé de Fuss-Catalan du groupe diédral.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • m-Tamari lattice
  • m-Dyck paths
  • m-cover poset
  • Fuss-Catalan combinatorics
  • Symmetric group
  • Dihedral group
  • Left-modularity
  • Trimness
  • Möbius function
Preview
Loading PDF preview...