Emily Barnard ; Nathan Reading - Coxeter-biCatalan combinatorics

dmtcs:2519 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2519
Coxeter-biCatalan combinatoricsConference paper

Authors: Emily Barnard 1; Nathan Reading ORCID1

  • 1 Department of mathematics [North Carolina]

[en]
We consider several counting problems related to Coxeter-Catalan combinatorics and conjecture that the problems all have the same answer, which we call the $W$ -biCatalan number. We prove the conjecture in many cases.

[fr]
Nous considérons des problèmes énumératifs liés à la combinatoire de Coxeter-Catalan et conjecturons que tous les problèmes ont la même solution, que nous appelons le nombre $W$ -biCatalan. Nous prouvons la conjecture dans de nombreux cas.

https://doi.org/10.46298/dmtcs.2519
Source: HAL:hal-01337831v1
Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] alternating arc diagram, doubled root poset, twin nonnesting partitions, twin sortable element
Licence: Attribution 4.0 International (CC BY 4.0)
Funding:
    Source : OpenAIRE Graph
  • EMSW21-MCTP: Institute for Mathematics at North Carolina State University. (I'M at State); Funder: National Science Foundation; Code: 0943855
  • Coxeter combinatorics and cluster algebras; Funder: National Science Foundation; Code: 1101568
  • Combinatorics and geometry of mutations; Funder: National Science Foundation; Code: 1500949

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 392 times.
This article's PDF has been downloaded 590 times.