Abstract
We extend the concept of non-decreasing Dyck paths to t-Dyck paths. We denote the set of non-decreasing t-Dyck paths by \({{\mathcal D}}_t\). Several classic questions studied in other families of lattice paths are studied here for \({{\mathcal D}}_t\). We use generating functions, recursive relations and Riordan arrays to count, for example, the following aspects: the number of non-decreasing paths in \({{\mathcal D}}_t\) with a given fixed length, the total number of prefixes of all paths in \({{\mathcal D}}_t\) of a given length, and the total number of paths in \({{\mathcal D}}_t\) with a fixed number of peaks. We give a generating function to count the number of paths in \({{\mathcal D}}_t\) that can be written as a concatenation of a given fixed number of primitive paths and we give a relation between paths in \({{\mathcal D}}_t\) and direct column-convex polyominoes.
Similar content being viewed by others
References
Aval, J.-C.: Multivariate Fuss–Catalan numbers. Discrete Math. 308, 4660–4669 (2008)
Barcucci, E., Del Lungo, A., Fezzi, A., Pinzani, R.: Nondecreasing Dyck paths and q-Fibonacci numbers. Discrete Math. 170, 211–217 (1997)
Barcucci, E., Pinzani, R., Sprugnoli, R.: Directed column-convex polyominoes by recurrence relations. Lect. Notes Comput. Sci. 668, 282–298 (1993)
Cameron, N.T., McLeod, J.E.: Returns and hills on generalized Dyck paths. J. Integer Seq. 19, Article 16.6.1 (2016)
Cheon, G.-S., Jin, S.-T.: Structural properties of Riordan matrices and extending the matrices. Linear Algebra Appl. 435, 2019–2032 (2011)
Czabarka, E., Flórez, R., Junes, L.: Some enumerations on non-decreasing Dyck paths. Electron. J. Combin. 22(# P1.3), 1–22 (2015)
Czabarka, E., Flórez, R., Junes, L., Ramírez, J.L.: Enumerations of peaks and valleys on non-decreasing Dyck paths. Discrete Math. 341, 2789–2807 (2018)
Deutsch, E., Prodinger, H.: A bijection between directed column-convex polyominoes and ordered trees of height at most three. Theor. Comput. Sci. 307, 319–325 (2003)
Elizalde, S., Flórez, R., Ramírez, J.L.: Enumerating symmetric peaks in nondecreasing Dyck paths. ARS Math. Contemp. (accepted)
Flórez, R., Junes, L., Ramírez, J.L.: Counting asymmetric weighted pyramids in non-decreasing Dyck paths. Australas. J. Combin. 79(1), 123–140 (2021)
Flórez, R., Junes, L., Ramírez, J.L.: Enumerating several aspects of non-decreasing Dyck paths. Discrete Math. 342, 3079–3097 (2019)
Flórez, R., Ramírez, J.L.: Some enumerations on non-decreasing Motzkin paths. Australas. J. Combin. 72(1), 138–154 (2018)
Flórez, R., Ramírez, J.L., Velandia, F.A., Villamizar, D.: Some statistics on restricted Dyck paths. Discrete Math. Algorithms Appl. (accepted)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
He, T.-X., Sprugnoli, R.: Sequence characterization of Riordan arrays. Discrete Math. 309, 3962–3974 (2009)
He, T.-X., Shapiro, L.W.: Fuss–Catalan matrices, their weighted sums, and stabilizer subgroups of the Riordan group. Linear Algebra Appl. 532, 25–42 (2017)
Heubach, S., Li, N.Y., Mansour, T.: Staircase tilings and k-Catalan structures. Discrete Math. 308, 5954–5964 (2008)
Merlini, D., Rogers, D.G., Sprugnoli, R., Verri, M.C.: On some alternative characterizations of Riordan arrays. Can. J. Math. 49(2), 301–320 (1997)
Penaud, J.G., Roques, O.: Génération de chemins de Dyck à pics croissants, [Generation of Dyck paths with increasing peaks]. Discrete Math. 246, 255–267 (2002)
Riordan, J.: Combinatorial Identities. Wiley, New York (1968)
Rogers, D.G.: Pascal triangles, Catalan numbers and renewal arrays. Discrete Math. 22, 301–310 (1978)
Shapiro, L.W., Getu, S., Woan, W., Woodson, L.: The Riordan group. Discrete Appl. Math. 34, 229–239 (1991)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. http://oeis.org/
Stanley, R.: Enumerative Combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2012)
Stanley, R.: Catalan Numbers. Cambridge University Press, Cambridge (2015)
Yang, S.-L., Wang, L.J.: Taylor expansions for the m-Catalan numbers. Australas. J. Combin. 64, 420–431 (2016)
Acknowledgements
The authors thank the referees for their comments which helped to improve the paper. Rigoberto Flórez was partially supported by The Citadel Foundation. José L. Ramírez was partially supported by Universidad Nacional de Colombia, Project No. 46240. He started working on this project when he was in a short research visit at The Citadel.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Flórez, R., Ramírez, J.L. Enumerations of Rational Non-decreasing Dyck Paths with Integer Slope. Graphs and Combinatorics 37, 2775–2801 (2021). https://doi.org/10.1007/s00373-021-02392-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-021-02392-9
Keywords
- Non-decreasing t-Dyck path
- Generating function
- Riordan array
- Direct column-convex polyominoes
- Fuss–Catalan number