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. Rational Catalan Com ...
Conference paper

Rational Catalan Combinatorics: The Associahedron

Drew Armstrong (1), Brendon Rhoades (2), Nathan Williams ORCID (3)
(1) Department of Mathematics [Miami]
(2) Department of Mathematics [Univ California San Diego]
(3) Department of Mathematics [Minneapolis]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2012
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.2355
License
https://about.hal.science/hal-authorisation-v1
Combinatorics of Root Systems
Indicators
1091
Views
1020
Downloads

Rational Catalan Combinatorics: The Associahedron

Drew Armstrong (1), Brendon Rhoades (2), Nathan Williams ORCID (3)
(1) Department of Mathematics [Miami]
(2) Department of Mathematics [Univ California San Diego]
(3) Department of Mathematics [Minneapolis]
Abstract
Each positive rational number $x>0$ can be written $\textbf{uniquely}$ as $x=a/(b-a)$ for coprime positive integers 0<$a$<$b$. We will identify $x$ with the pair $(a,b)$. In this extended abstract we use $\textit{rational Dyck paths}$ to define for each positive rational $x>0$ a simplicial complex $\mathsf{Ass} (x)=\mathsf{Ass} (a,b)$ called the $\textit{rational associahedron}$. It is a pure simplicial complex of dimension $a-2$, and its maximal faces are counted by the $\textit{rational Catalan number}$ $\mathsf{Cat} (x)=\mathsf{Cat}(a,b):=\frac{(a+b-1)! }{ a! b!}.$ The cases $(a,b)=(n,n+1)$ and $(a,b)=(n,kn+1)$ recover the classical associahedron and its Fuss-Catalan generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that $\mathsf{Ass} (a,b)$ is shellable and give nice product formulas for its $h$-vector (the $\textit{rational Narayana numbers}$) and $f$-vector (the $\textit{rational Kirkman numbers}$). We define $\mathsf{Ass} (a,b)$ .
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • associahedron
  • Dyck path
  • $f$-vector
  • $h$-vector
  • shelling
  • noncrossing partition
Cited by

Source: OpenCitations

  • Compactified Jacobians and q,t-Catalan numbers, II

    Journal of Algebraic Combinatorics

    Authors : Evgeny Gorsky ORCID, Mikhail Mazin

    Journal reference : Volume 39, 2013, pp. 153-186

    DOI : 10.1007/s10801-013-0443-z
  • The combinatorics of knot invariants arising from the study of Macdonald polynomials

    ˜The œIMA volumes in mathematics and its applications

    Authors : Jim Haglund

    Journal reference : Volume , 2016, pp. 579-600

    DOI : 10.1007/978-3-319-24298-9_23
  • Refined knot invariants and Hilbert schemes

    Journal de Mathématiques Pures et Appliquées

    Authors : Eugene Gorsky ORCID, Andrei Neguţ ORCID

    Journal reference : Volume 104, 2015, pp. 403-435

    DOI : 10.1016/j.matpur.2015.03.003
  • Strange expectations and simultaneous cores

    Journal of Algebraic Combinatorics

    Authors : Marko Thiel ORCID, Nathan Williams ORCID

    Journal reference : Volume 46, 2017, pp. 219-261

    DOI : 10.1007/s10801-017-0754-6
  • A Polynomial Expression for the Character of Diagonal Harmonics

    Annals of Combinatorics

    Authors : A. Garsia, J. Haglund

    Journal reference : Volume 19, 2015, pp. 693-703

    DOI : 10.1007/s00026-015-0284-7
  • Bidirectional Algorithms for Polygon Triangulations and (m + 2)-Angulations via Fuss–Catalan Numbers

    Mathematics

    Authors : Aybeyan Selim ORCID, Muzafer Saracevic ORCID, Lazar Stosic ORCID, Omer Aydin ORCID, Mahir Zajmović

    Journal reference : Volume 13, 2025, pp. 3837

    DOI : 10.3390/math13233837
  • The Kernel Method for Lattice Paths Below a Line of Rational Slope

    DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Authors : Cyril Banderier ORCID, Michael Wallner ORCID

    Journal reference : Volume , 2019, pp. 119-154

    DOI : 10.1007/978-3-030-11102-1_7
Preview
Loading PDF preview...