Myrto Kallipoliti ; Martina Kubitzke - Double homotopy Cohen-Macaulayness for the poset of injective words and the classical NC-partition lattice

dmtcs:2935 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2935
Double homotopy Cohen-Macaulayness for the poset of injective words and the classical NC-partition latticeConference paper

Authors: Myrto Kallipoliti ORCID1,2; Martina Kubitzke 3

  • 1 Department of Mathematics [Athens]
  • 2 Erwin Schrödinger Institute for Mathematical Physics
  • 3 Fakultät für Mathematik [Wien]

[en]
In this paper we study topological properties of the poset of injective words and the lattice of classical non-crossing partitions. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these posets are doubly Cohen-Macaulay. This extends the well-known result that those posets are shellable. Both results rely on a new poset fiber theorem, for doubly homotopy Cohen-Macaulay posets, which can be considered as an extension of the classical poset fiber theorem for homotopy Cohen-Macaulay posets.

[fr]
Dans cet article, nous étudions certaines propriétés topologiques du poset des mots injectifs et du treillis des partitions non-croisées classiques. Plus précisément, nous montrons qu'après suppression des plus petit et plus grand élément (s'ils existent), ces posets sont doublement Cohen-Macaulay. C'est une extension du fait bien connu que ces deux posets sont épluchables ("shellable''). Ces deux résultats reposent sur un nouveau théorème poset-fibre pour les posets doublement homotopiquement Cohen-Macaulay, que l'on peut voir comme extension du théorème poset-fibre classique pour les posets homotopiquement Cohen-Macaulay.


Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] injective words, non-crossing partitions, strongly constructible, doubly homotopy Cohen-Macaulay, poset fiber theorem
Funding:
    Source : OpenAIRE Graph
  • Compact enumeration formulas for generalized partitions; Code: Y 463

Consultation statistics

This page has been seen 336 times.
This article's PDF has been downloaded 505 times.