Riordan lattice paths counted by area

A mix of human-written and AI-generated textHuman understanding: some partsmath.MP — Mathematical Physicsmath.PR — Probability

Contributed by Ilmar Gahramanov ↗

Version 1 / Nov 02, 2026 / CC BY 4.0

Abstract

We study Riordan paths enumerated by the area between the path and the axis. We show that the generating function satisfies a qq-Riccati equation and can be written in a closed form as a ratio of basic hypergeometric series. The auxiliary series admits an algebraic representation as the motivic generating series of a symmetric two-node quiver. We obtain explicit formulas for the coefficients, the exponential asymptotics of the number of paths of given area, and a linear recurrence whose coefficients are signed counts of partitions into distinct parts. For a random path of area nn we obtain a joint Gaussian limit law for the numbers of returns, horizontal steps and up steps. The height is of order log⁡n\sqrt{\log n}, and its distribution concentrates on two adjacent integers determined explicitly by nn.

Provenance statement

Large language models were used in the literature search, computer-assisted checks and preparation of the manuscript. The original derivation of Section~\ref{sec:limit} and Appendix~\ref{app:proof} was obtained entirely with the assistance of Claude (Anthropic). ChatGPT (OpenAI) assisted with subsequent mathematical and editorial refinements, including the joint Gaussian and two-height corollaries, and with independent numerical checks.

Tools used

Anthropic
Claude Fable
OpenAI
ChatGPT

References

  1. A. L. Owczarek and T. Prellberg, Enumeration of area-weighted Dyck paths with restricted height, Australas. J. Combin. 54 (2012), 13--18.
  2. A. P. Polychronakos, Length and area generating functions for height-restricted Motzkin meanders, Phys. Rev. E 105 (2022), 024102.
  3. L. Gan, Lattice random walks and quantum A-period conjecture, SciPost Phys. 19 (2025), 053.
  4. L. Gan, S. Ouvry and A. P. Polychronakos, Combinatorics of generalized Dyck and Motzkin paths, Phys. Rev. E 106 (2022), 044123.
  5. S. Ouvry and A. P. Polychronakos, Hamiltonian and exclusion statistics approach to discrete forward-moving paths, Phys. Rev. E 104 (2021), 014143.
  6. I. Gahramanov and E. T. Musaev, Integrability properties of Motzkin polynomials, J. Math. Phys. 61 (2020), 033509.
  7. F. Aydogmus and M. Mullahasanoglu, Arithmetic selection rules in dispersionless Hamiltonian systems, arXiv:2608.11179 (2026).arXiv
  8. M. Mullahasanoglu, Liouville integrable binomial Hamiltonian system, J. Phys. Conf. Ser. 2667 (2023), 012041.
  9. P. Kucharski, M. Reineke, M. Stošić and P. Suł kowski, Knots-quivers correspondence, Adv. Theor. Math. Phys. 23 (2019), 1849--1902.
  10. M. Panfil, M. Stošić and P. Suł kowski, Donaldson-Thomas invariants, torus knots, and lattice paths, Phys. Rev. D 98 (2018), 026022.
Show all 22 referencesShow fewer references
  1. M. Stošić and P. Suł kowski, Torus knots and generalized Schröder paths, Nuclear Phys. B 1012 (2025), 116814.
  2. D. or ević and M. Stošić, Lattice paths and quiver generating series with higher level generators, arXiv:2408.01832 (2024).arXiv
  3. A. Dwivedi and R. Pichai, Double twist knots and lattice paths, arXiv:2605.02786 (2026).arXiv
  4. C. Ji, Q. Tang and C. Yang, Schröder paths, their generalizations and knot invariants, arXiv:2407.20010 (2024).arXiv
  5. M. Stošić, Generalized knots-quivers correspondence, J. Knot Theory Ramifications 34 (2025), 2550053.
  6. P. Kucharski and D. Noshchenko, Knot-quiver correspondence: a brief review, arXiv:2505.05668 (2025).arXiv
  7. P. Flajolet, Combinatorial aspects of continued fractions, Discrete Math. 32 (1980), 125--161.
  8. P. Flajolet and R. Sedgewick, Analytic combinatorics , Cambridge University Press, Cambridge, 2009.
  9. OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A143951.link
  10. A. J. Bu, Explicit generating functions for the sum of the areas under Dyck and Motzkin paths (and for their powers), Discrete Math. Lett. 14 (2024), 1--6.
  11. D. Merlini, Generating functions for the area below some lattice paths, Discrete Math. Theor. Comput. Sci. Proc. AC (2003), 217--228.
  12. G. Gasper and M. Rahman, Basic hypergeometric series , 2nd ed., Cambridge University Press, Cambridge, 2004.

Version history

  1. v1Submitted by Ilmar GahramanovInitial depositCurrentOct 31, 2026