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. Crossings and nestin ...
Conference paper

Crossings and nestings in set partitions of classical types

Martin Rubey (1), Christian Stump (2)
(1) Institut für Algebra, Zahlentheorie und Diskrete Mathematik
(2) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Proceedings
DOI
10.46298/dmtcs.2826
License
https://about.hal.science/hal-authorisation-v1
Indicators
624
Views
473
Downloads

Crossings and nestings in set partitions of classical types

Martin Rubey (1), Christian Stump (2)
(1) Institut für Algebra, Zahlentheorie und Diskrete Mathematik
(2) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Abstract
English
In this extended abstract, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections for types $B$ and $C$ that interchange crossings and nestings, which generalize a construction by Kasraoui and Zeng for type $A$. On the other hand we generalize a bijection to type $B$ and $C$ that interchanges the cardinality of a maximal crossing with the cardinality of a maximal nesting, as given by Chen, Deng, Du, Stanley and Yan for type $A$. For type $D$, we were only able to construct a bijection between non-crossing and non-nesting set partitions. For all classical types we show that the set of openers and the set of closers determine a non-crossing or non-nesting set partition essentially uniquely.
French
Dans ce résumé, nous étudions des bijections entre diverses classes de partitions d'ensemble de types classiques qui préservent les "openers'' et les "closers''. D'une part, nous présentons des bijections pour les types $B$ et $C$ qui échangent croisées et emboôtées, qui généralisent une construction de Kasraoui et Zeng pour le type $A$. D'autre part, nous généralisons une bijection pour le type $B$ et $C$ qui échange la cardinalité d'un croisement maximal avec la cardinalité d'un emboîtement maximal comme il a été fait par Chen, Deng, Du, Stanley et Yan pour le type $A$. Pour le type $D$, nous avons seulement construit une bijection entre les partitions non croisées et non emboîtées. Pour tout les types classiques, nous montrons que l'ensemble des "openers'' et l'ensemble des "closers'' déterminent une partition non croisées ou non emboîtées essentiellement de façon unique.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • non-crossing partitions
  • non-nesting partitions
  • k-crossing partitions
  • k-nesting partitions
  • bijective combinatorics
Cited by

Source: OpenCitations

  • Noncrossing sets and a Graßmannian associahedron

    Discrete Mathematics & Theoretical Computer Science

    Authors : Francisco Santos ORCID, Christian Stump ORCID, Volkmar Welker ORCID

    Journal reference : Volume DMTCS Proceedings vol. AT,..., 2014, pp.

    DOI : 10.46298/dmtcs.2427
  • NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON

    Forum of Mathematics Sigma

    Authors : FRANCISCO SANTOS ORCID, CHRISTIAN STUMP ORCID, VOLKMAR WELKER ORCID

    Journal reference : Volume 5, 2017, pp.

    DOI : 10.1017/fms.2017.1
  • Charmed roots and the Kroweras complement

    Journal of the London Mathematical Society

    Authors : Benjamin Dequêne, Gabriel Frieden, Alessandro Iraci ORCID, Florian Schreier‐Aigner ORCID, Hugh Thomas ORCID, Nathan Williams ORCID

    Journal reference : Volume 110, 2024, pp.

    DOI : 10.1112/jlms.70025
  • Pattern avoiding permutations and independent sets in graphs

    arXiv (Cornell University)

    Authors : Christian Bean ORCID, Murray Tannock ORCID, Henning Ulfarsson ORCID

    Journal reference : Volume 11, 2020, pp. 705-732

    DOI : 10.4310/joc.2020.v11.n4.a7
  • Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions

    Theoretical Computer Science

    Authors : Alessandro Conflitti ORCID, Ricardo Mamede ORCID

    Journal reference : Volume 592, 2015, pp. 87-96

    DOI : 10.1016/j.tcs.2015.05.021
  • A uniform bijection between nonnesting and noncrossing partitions

    Transactions of the American Mathematical Society

    Authors : Drew Armstrong, Christian Stump ORCID, Hugh Thomas ORCID

    Journal reference : Volume 365, 2013, pp. 4121-4151

    DOI : 10.1090/s0002-9947-2013-05729-7
  • On Noncrossing and Nonnesting Partitions of Type D

    Annals of Combinatorics

    Authors : Alessandro Conflitti ORCID, Ricardo Mamede ORCID

    Journal reference : Volume 15, 2011, pp. 637-654

    DOI : 10.1007/s00026-011-0114-5
  • Folded bump diagrams for partitions of classical types

    Advances in Applied Mathematics

    Authors : Chao-Ping Dong

    Journal reference : Volume 62, 2014, pp. 141-159

    DOI : 10.1016/j.aam.2014.09.008
  • New interpretations for noncrossing partitions of classical types

    Journal of Combinatorial Theory Series A

    Authors : Jang Soo Kim ORCID

    Journal reference : Volume 118, 2011, pp. 1168-1189

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