Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
From MaRDI portal
Publication:2352782
DOI10.1016/j.dam.2015.04.005zbMath1316.05075arXiv1406.2449OpenAlexW832479814WikidataQ113877261 ScholiaQ113877261MaRDI QIDQ2352782
Yingying Nie, Xuezhi Sun, Rosena R. X. Du
Publication date: 6 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.2449
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items
Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths, Bijective counting of humps and peaks in \((k, a)\)-paths
Cites Work
- Rational associahedra and noncrossing partitions
- Counting humps in Motzkin paths
- Staircase tilings and \(k\)-Catalan structures
- The method of creative telescoping
- Bijective counting of humps and peaks in \((k, a)\)-paths
- Counting humps and peaks in generalized Motzkin paths
- Unnamed Item
- Unnamed Item
- Unnamed Item