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. Bijections between n ...
Conference paper

Bijections between noncrossing and nonnesting partitions for classical reflection groups

Alex Fink (1), Benjamin Iriarte Giraldo (2)
(1) Department of Mathematics [Berkeley]
(2) Universidad de los Andes [Bogota]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2008
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Proceedings
DOI
10.46298/dmtcs.2737
License
https://about.hal.science/hal-authorisation-v1
Fundação para a Ciência e a Tecnologia, I.P.
PTDC/CCI-BIO/29266/2017
Deep Drug Discovery and Deployment
Indicators
649
Views
612
Downloads

Bijections between noncrossing and nonnesting partitions for classical reflection groups

Alex Fink (1), Benjamin Iriarte Giraldo (2)
(1) Department of Mathematics [Berkeley]
(2) Universidad de los Andes [Bogota]
Abstract
We present $\textit{type preserving}$ bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types $B$, $C$ and $D$ are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspondence is established by means of elementary methods in all cases. The statistics can be then seen to be counted by the generalized Catalan numbers Cat$(W)$ when $W$ is a classical reflection group. In particular, the statistics of type $A$ appear as a new explicit example of objects that are counted by the classical Catalan numbers.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • noncrossing partition
  • nonnesting partition
  • reflection group
  • catalan number
  • coxeter group
Cited by

Source: OpenCitations

  • 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
  • Symmetry of Narayana Numbers and Rowvacuation of Root Posets

    Forum of Mathematics Sigma

    Authors : Colin Defant ORCID, Sam Hopkins

    Journal reference : Volume 9, 2021, pp.

    DOI : 10.1017/fms.2021.47
  • H C++ Programming

    Combinatorics of Set Partitions

    Authors : Toufik Mansour

    Journal reference : Volume , 2012, pp. 547-564

    DOI : 10.1201/b12691-22
  • 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
Preview
Loading PDF preview...