WorksMathematics
Riordan lattice paths counted by area
Abstract
We study Riordan paths enumerated by the area between the path and the axis. We show that the generating function satisfies a -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 we obtain a joint Gaussian limit law for the numbers of returns, horizontal steps and up steps. The height is of order , and its distribution concentrates on two adjacent integers determined explicitly by .
Introduction
Lattice paths weighted by area appear in polymer and vesicle models [1, 2], in the study of exclusion statistics and Hofstadter-type Hamiltonians [3, 4, 5], and in knot theory.1 Namely, in the so-called knots-quivers correspondence [9, 10, 11] certain families of paths below lines of rational slope encode coloured HOMFLY-PT invariants of torus knots. For several directed-path models, -difference equations and quotients of -series provide a useful description of the generating functions. For further developments in the knot-theoretic direction see [12, 13, 14, 15] and the review [16].
In this paper we study Riordan paths at fixed area. Recall that a Motzkin path of length runs from to with steps , and and never passes below the -axis. A Riordan path is a Motzkin path with no horizontal steps on the axis, and a Dyck path has no horizontal steps at all. Enumeration by length gives the Riordan numbers and the Catalan numbers, respectively. Here we instead fix the area between the path and the axis, and we assign the weight to each up step and the weight to each horizontal step.
Let us mention that length-area generating functions for Motzkin meanders with boundary markers were obtained by Polychronakos [2]; setting the weight of horizontal steps on the floor to zero in his formulas gives the Riordan case. Counts with prescribed step profiles were also studied by Gan, Ouvry and Polychronakos [4]. Here we use these path decompositions to study the fixed-area ensemble. We give explicit coefficient formulas and a partition recurrence, and determine the exponential growth, additive statistics and height distribution at large area. We also express the auxiliary -series as the generating series of a symmetric two-node quiver; this is an algebraic identity, without an associated knot invariant.
Let be the weight polynomial of the paths of area and let . As the point of departure one may regard the following functional equation,
which follows from a decomposition of the path at its first horizontal step at height one or its first return to the axis. The substitutions and account for the area gained when a path is lifted by one level. A continued fraction expansion then leads to the closed form
where stand for homogeneous forms of the Rogers continuous -Hermite polynomials, defined in § 4. Here and below we use the standard notation
with and . The identity (2) holds as a formal power series in , and the quotient also gives the meromorphic continuation of to the unit disc. For it reduces to the Rogers-Ramanujan type formula for Dyck paths counted by area [17, 18]. After the substitution , , the series turns out to be the motivic generating series of the quiver with adjacency matrix . This allows one to compare (2) with the quiver-series expressions for area-weighted Schröder paths [10, 11], although by itself it does not give a knot interpretation of Riordan paths.
The rest of the paper is organized as follows. In § 2 we define the area polynomials and list the first examples. In § 3 we prove the functional equation (1) and derive a recurrence for the polynomials . In § 4 we obtain the continued fraction and the closed form (2), including the case of bounded height. In § 5 we give explicit formulas for the coefficients in terms of path profiles. In § 6 we derive the asymptotics of the number of paths and a linear recurrence with partition-theoretic coefficients. In § 7 we study the limit laws of additive statistics and of the height. We conclude with remarks and open problems.2
| 300 | 0.5451536770 | 0.9976892919 | |
| 600 | 0.2919739476 | 0.9952539517 | |
| 1500 | 0.0448558995 | 0.9879835406 |
Table 1. Height probabilities for a random Riordan path of area , from exact bounded-height counts.
Riordan paths and area polynomials
In this section we fix the notation and state the problem. Let us first explain how the area of a path is computed. A step from height to height contributes to the area. In other words, an up or down step between heights and contributes , while a horizontal step at height contributes . Note that the total area is an integer, since the numbers of up and down steps are equal. Every allowed step contributes at least , so a Riordan path of area has length at most , and in particular there are only finitely many such paths.3 For we define
where the sum runs over Riordan paths of area , and and stand for the numbers of up and horizontal steps of . A path with up steps and horizontal steps has weight and length . One can easily compute the first polynomials,
and are listed in Appendix A. For instance, the path in Figure 1 has area and weight ; it is one of the two paths giving the term of . The numbers of Riordan paths of area are, starting at ,

Figure 1. The path , of area .
with . The Dyck sequence begins, for , with and is recorded as OEIS A143951 [19].4
The functional equation
In this section we derive the functional equation (1). The key observation is very simple. If one lifts a path by one level, every step gains area , so the area increases by the length of the path. Since a path of weight has length , the lift is represented by the substitution , . In what follows we write .
Theorem 3.1. The generating function satisfies
For this can be rearranged as
with the factor cancelled formally. At one has , and the undivided identity remains valid.
Proof. A nonempty Riordan path starts with . Let us read it up to the first subsequent step which either returns to the axis or is horizontal at height . The segment in between is a Riordan path lifted by one level and contributes . If the distinguished step is , one has with an arbitrary Riordan path , which contributes . If the distinguished step is , one has , and removing leaves the nonempty Riordan path ; this case contributes . Adding the two contributions one obtains (5).
For nonzero , (5) is an equation of -Riccati type: the lifted function is a linear fractional transform of . For it reduces to the equation for Dyck paths counted by area, which goes back to Flajolet [17], see also [1, 18]; the Motzkin analogue was obtained by Polychronakos [2].5
Extracting the coefficient of in (5) one obtains the following recurrence for the area polynomials,
For example, the first factor is and the second one is , so that . Actually, the substitution retains the information about the length, which is needed for the lift, and as a result (6) does not close on the numbers alone. A scalar recurrence for will be given in Theorem 6.3.
Continued fraction and closed form
In this section we obtain the continued fraction expansion of and, from it, the closed form (2); we only need the simplest ingredients of the approach of Flajolet [17]. Let be the generating function of Motzkin paths based at height , with the area measured from the -axis. Such a path is a sequence of horizontal steps and excursions above height , and therefore and . In other words,
Paths of bounded height
Let us first look at the convergents of (7). Truncating the continued fraction at level one obtains the generating function of paths of height at most ; for one has . We write , where
with the factor replaced by at . Expanding this recurrence one recovers the standard interpretation of the convergents in terms of matchings, which also goes back to [17]. Namely, is the generating polynomial of monomer-dimer configurations on the path graph with vertices , where a monomer on the vertex has weight and a dimer on the edge has weight .6 Since every occupied vertex contributes , one can write, for ,
where the product runs over the maximal runs of consecutive integers in , and stands for the matching polynomial of the path with vertices. At the boundary we use . Equivalently, in the subset formula the run containing , if present, has weight and for , since the vertex must be covered by the dimer .
Two special cases can be written in a closed form. The dimer-only part, valid also at , is a -binomial sum,
which at agrees with the formula obtained by Owczarek and Prellberg for Dyck paths of bounded height [1]. The monomer-only part is for and for . It seems that the mixed contributions do not factor in a similar way.
At the exponential growth rate of the number of paths of height at most is , where denotes the smallest positive zero of . One finds
Paths of height one contribute at area , which explains the first value. For height at most two, is the largest root of . The rapid convergence to the limit is a curious phenomenon, which will be explained in Theorem 7.3.
The closed form
Let us now take . For each fixed one finds from (8) that , where
We usually suppress the dependence on and write for . At the boundary one has . Comparing coefficients, the solution of (10) is the series in (1.2), where the polynomials are determined by
Then and , which proves (1.2). Equivalently, .
Lemma 4.1. For fixed complex , the series is entire in and holomorphic in for . For each , the continuants converge to locally uniformly in this disc. In particular, (1.2) defines a meromorphic function of there.
Proof. Fix . The recurrence (11) gives for , with depending only on . Also . The factor therefore ensures local uniform convergence of the series for in .
For the continuants, ignore the exclusion constraints in the matching expansion. The sum of the absolute weights of all configurations on the infinite path is bounded by
The weights of configurations involving vertices beyond tend to zero uniformly on . Hence the finite continuants converge locally uniformly. Their formal limit, already identified above, is . The denominator in (1.2) is holomorphic and equals 1 at , which proves the last assertion. □
Remark 4.2. Let us write and . Then the solution of (11) takes the form
which is a homogeneous form of the continuous -Hermite polynomial of Rogers. Namely, one has for , with its polynomial extension at . Moreover, one can write
which is a -Bessel type function, see e.g. [22]. At apparent singularities of the product representation, the identity is understood by analytic continuation.
Remark 4.3 (An algebraic quiver-series representation). Let us introduce the so-called symmetric-quiver series
Since and , grouping the terms with one obtains the formal identities
Ratios of quiver series at -shifted arguments occur in the enumeration of area-weighted Schröder paths [10, 11], where the corresponding -difference equations are related to the so-called quantum -polynomials; combinatorial derivations of such equations appear in [14], and the coefficient formulas of [12] may be compared with Theorem 5.1 below. In the conventions of [11], the Schröder-path quiver of slope has the matrix , so that our matrix differs from its case by one diagonal entry. For the specialization (13) below can similarly be written as with , and the one-node quiver (2) appears in the formulas for the reduced unknot in framing two [11]. We stress that these are comparisons of formal series and adjacency matrices, not of knot invariants.
For , i.e. , the closed form becomes the Rogers–Ramanujan type identity
in agreement with [1, 18]. Finally, taking in (9) one obtains a second interpretation of the auxiliary series: for , enumerates partitions into distinct parts at least , with each maximal run of consecutive parts weighted by . We will need this interpretation in § 6.
Explicit formulas for the coefficients
In this section we give explicit formulas for the coefficients of . Let us start with a simple observation. Deleting the horizontal steps of a Riordan path leaves its Dyck skeleton. Conversely, one can insert an arbitrary run of horizontal steps at each skeleton vertex of positive height . Each inserted step has weight , and therefore
where the product runs over the vertices of of positive height. For fixed , the coefficient is a rational function of whose denominator divides . For example, and . In particular, the paths of height one contribute exactly to , which is the leading row visible in Appendix § 9.
In order to obtain a positive formula for all coefficients, we will need also the following profiles. The Dyck skeleton count used below is the lowest-floor case of [4, Eq. (18)]; that work also treats horizontal-step profiles. We include a direct proof to make the fixed-area constraint explicit. For a path , let be the number of its interior vertices at height , and let be the number of its up steps from height to . Summing the contributions of the endpoints of each step one finds
i.e. the area is the sum of the heights of the interior vertices. If has height , its up-profile is a composition of , and its skeleton has vertices at each height , where .
Theorem 5.1. Let be a composition and let be a sequence of positive integers, and set . Here a binomial coefficient is zero when its lower argument exceeds its nonnegative upper argument. The number of Riordan paths with up-profile and vertex profile is
Consequently,
where the sum runs over all nonempty compositions and denotes the number of parts. For , the number of paths of area with up steps and horizontal steps is
Proof. Let us first count the Dyck skeletons with profile . At level , the excursions above height are distributed among the excursions rising from height . This is a weak composition into parts, counted by , and applying this construction at successive levels one obtains the first factor.
Next, at height , one distributes horizontal steps among the skeleton vertices; there are choices, which gives the second factor. The area is then determined by (15). Since the skeleton has primitive components, exactly of its interior vertices lie on the axis, and therefore it has vertices of positive height. Inserting horizontal steps gives , which proves the formula for . Summing over the insertions at each height one obtains the generating function, where the term 1 represents the empty path. □
Asymptotics and a linear recurrence
In this section we determine the growth of the numbers and obtain a recurrence for them. The point of departure is the decomposition of a path into its primitive components, i.e. the pieces between consecutive returns to the axis. Every nonempty Riordan path decomposes uniquely into primitive paths, which touch the axis only at their endpoints. At their generating function is
Therefore and, by (2), . Each primitive component contributes one return to the axis, including the final one, so marking the returns by one obtains .
Theorem 6.1. Let be the radius of convergence of . The equation has a unique root , which is also the smallest positive root of at . For some ,
with
Proof. The series has nonnegative coefficients and a positive radius of convergence, since a path of area has length at most . By Lemma 4.1, is meromorphic in . The primitive paths give wherever both sides converge, so . If , Pringsheim’s theorem together with meromorphicity implies that is a pole and as . If , the same divergence follows from the lower bound. Since is strictly increasing on , it reaches 1 at a unique point .
For one has . On , equality in the triangle inequality requires the terms of degrees 1 and 2 to have the same argument, and their positive coefficients force . Thus has a unique zero in the closed disc, and this zero is simple because . Analyticity in
a larger disc and isolation of zeros give an exponentially smaller remainder after subtraction of the simple pole, and the residue gives .
It remains to rule out a cancellation in the quotient for . Let us display the base parameter of explicitly. If, for some , both and vanished, the recurrence for ,
would force for every , which contradicts . Consequently a zero of cannot cancel in , so for . On this interval the denominator is , and its first positive zero is . □
Let us make a few comments. The leading asymptotics is already accurate at modest area; namely, . A further positive pole is found numerically at , and the argument principle applied numerically on the circles , , gives 1, 1, 2 zeros of . These computations suggest that any is admissible in Theorem 6.1; we do not use this sharper, uncertified estimate. We do not know closed forms for and ; the Dyck constants and recorded in OEIS A143951 [19] are likewise only known numerically. For positive weights the same argument applies whenever the primitive generating function reaches 1 strictly inside its radius of convergence, which holds near .
A recurrence for
Let us now come back to the partition interpretation of § 4. We write and . Then counts partitions of into distinct parts, with each maximal run of consecutive parts weighted by , and counts the same partitions with the additional restriction that every part is at least 2. The run weights turn out to be periodic, namely for , respectively. The following simple cancellation explains this periodicity.
Lemma 6.2. Let us write a perfect monomer-dimer cover of the path with vertices as a word in the letters and , with sign . The map exchanging a leading with a leading , and fixing the words with neither prefix, is an involution which reverses the sign on its nonfixed pairs. Its fixed points are the words , together with and the empty word. Hence for , with the initial values .
Theorem 6.3. Let , set , and let for . Then
where , the sum being over partitions of into distinct parts with no run of length , and is the same sum over partitions with parts . The first values are
Proof. This is the identity written out coefficientwise. □
It is worth mentioning that the coefficients of the recurrence are small compared with , since their absolute values are bounded by partition counts; for example, for , whereas .
Limit laws
In this section we describe a typical Riordan path of large area. In a few words, such a path looks like a long sequence of small primitive components, and the statistics we are interested in are sums over the components. The point of departure is again the decomposition into primitive paths. Since , one can assign the probability to each primitive path ; this defines a probability distribution on primitive paths, which we call the Boltzmann distribution. Let be the area of a Boltzmann primitive path and let be an additive statistic, namely its number of returns, of horizontal steps or of up steps. Note that . In other words, the constant of Theorem 6.1 is the inverse of the mean area of a primitive component.
Additive statistics
Let us first consider the statistics which are additive over the components. The following theorem says that they behave like sums of independent random variables, and that the constants are the ones of the classical renewal-reward theorem.
Theorem 7.1. Let a Riordan path of area be chosen uniformly at random, and let , , be its numbers of returns to the axis, of horizontal steps and of up steps. Each of these is asymptotically Gaussian. Namely, for any one of them, denoted by ,
where
Numerically,
For the returns one has .
Proof. Let be the generating function of primitive paths with the statistic marked by . Then the bivariate generating function is , i.e. we are dealing with the so-called supercritical sequence schema of Flajolet and Sedgewick [18 Chapter IX]. Let us choose and with . Each statistic satisfies , so the marked series is dominated by for , , and is therefore jointly analytic in a neighbourhood of . As a result, the simple dominant pole persists for near , with uniform asymptotics of the coefficients, and the quasi-powers theorem of Hwang [18 Chapter IX] gives a Gaussian law with and , where is the root of near , provided that . Differentiating twice at and writing the derivatives of as Boltzmann moments one obtains (16). It remains to check that the variance is positive. Actually, this is clear, since is not almost surely constant. Indeed, the primitive paths , and have for returns, for horizontal steps and for up steps, and in each case takes at least two values.
It is worth mentioning that the mean number of returns per unit area coincides with the prefactor of Theorem 6.1, and that the mean length of a path of area is .7
Corollary 7.2. Let and . For a Boltzmann primitive path, write . Then
where the matrix
is positive definite.
Proof. Mark the three statistics by in the primitive series . Each component of is at most , so joint analyticity follows by choosing and with . The simple pole persists at an analytic root near , with uniform coefficient asymptotics. Consequently, for near zero,
where is analytic, , and . Differentiating gives the gradient and the Hessian (7.2) of at zero. The Taylor expansion at gives the joint Gaussian limit; differentiation gives the covariance estimate.
To check nondegeneracy, suppose for every primitive path. Applying this relation to , , and gives
These equations imply . Thus no nonzero linear combination of has zero variance, and is positive definite. □
The height
Let us now turn to the height , which is not additive and behaves quite differently. The idea is the following. The height of a path is the maximum of the heights of its components, and a primitive component of height larger than is very rare under the Boltzmann distribution, since the smallest such path is the pyramid of area . Therefore the height of a path of area is determined by the balance between the number of components, which is of order , and this small probability. To make this precise, for let be the generating function of primitive paths of height at most , and let be the positive root of within its disc of convergence. We set and , so that is the Boltzmann probability that a primitive path has height greater than . The following theorem gives an exact formula for and the resulting law of the height.
Theorem 7.3. Let and let be its truncation at height . At one has, for ,
and
There exist , and constants such that, uniformly in ,
Consequently, with ,
and
The proof, which is based on an exact telescoping formula for , is somewhat technical and is given in Appendix § 10.
Corollary 7.4. Put
Then as .
Proof. Write . Since ,
for all sufficiently large . In the approximation of Theorem 7.3, the exponent therefore tends to infinity at and to zero at . Hence and . □
Remark 7.5. Let us stress that the double-exponential form in Theorem 7.3 describes the distribution at integer thresholds only and should not be interpreted as a continuous Gumbel limit. Indeed, with is not tight: choosing integers with , every integer square is at distance at least from .
Numerically, one finds , , and for , and exact bounded-height counts give the probabilities in Table 1. At area 1500, the probability of height exactly three is about 0.9431. The slow growth and two-height concentration differ sharply from the square-root height scale of uniformly chosen Motzkin paths of fixed length.
Concluding remarks
In this work, we have studied Riordan paths enumerated by area. We have shown that the enumeration is governed by a single auxiliary -series. Its continued fraction representation gives the generating functions of paths of bounded height, while its expansion over partitions into distinct parts yields a linear recurrence for the area counts. The decomposition into primitive paths determines the dominant pole and the joint Gaussian law for additive statistics. It also gives the tail of the height distribution, whose leading term is fixed by the area of the smallest path reaching height . The uniform estimate implies concentration on two adjacent heights.
The auxiliary series admits an algebraic representation as the motivic generating series of the symmetric quiver , after the substitution , , and the Dyck specialization admits a one-node representation. These identities allow a comparison with the quiver generating series appearing in knot theory, but we do not identify a knot invariant for Riordan paths; it seems that this would require additional structure beyond the identities obtained here.
The path decomposition and the continued fraction extend to horizontal steps with integer , forbidden on the axis; the case gives Schröder-type paths. Such a step at height has area . Writing , the functional equation takes the form
and the continued fraction has in place of . The corresponding auxiliary function satisfies
For general the -Hermite and quiver representations require a separate analysis. At the growth constants for are 2.2516612, 1.8656543, 1.7182811 and 1.6413284; they decrease to the Dyck value 1.5085198 . . ., since increasing decreases the primitive weights and the simple-root argument gives the convergence of the poles.
Several questions remain. The signed partition recurrence in Theorem 6.3 suggests a direct sign-reversing involution on suitable pairs of paths and partitions. For the additive statistics, local limit laws and quantitative error estimates would refine Corollary 7.2. Step sets with several jump sizes may require more general continued fractions. It also remains to understand whether the two-node quiver representation has a meaning beyond the algebraic identity established here.
Acknowledgements
Acknowledgements. Large language models were used in the literature search, computer-assisted checks and preparation of the manuscript. The original derivation of § 7 and Appendix § 10 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. The work of Ilmar Gahramanov is partially supported by the Istanbul Integrability and Stringy Topics Initiative (istringy.org).
The polynomials
Here we list the polynomials ; terms are grouped by decreasing total degree.
The numbers of paths of area with returns are, for : 1; 1, 1; 1, 2, 1; 2, 3, 3, 1; 3, 6, 6, 4, 1; 5, 11, 13, 10, 5, 1; 8, 20, 27, 24, 15, 6, 1; 13, 36, 54, 55, 40, 21, 7, 1.
Proof of Theorem 7.3
Proof of Theorem 7.3. Let us first prove the formula for . To this end we write and . Subtracting the recursions for and , with , one finds
Since , iteration gives
Note that the exponent is precisely the area of the pyramid of height . On a sufficiently small complex neighbourhood of the factors are analytic and nonzero. Moreover, for some one has and uniformly in , and for each fixed the latter converges locally uniformly to . These summable bounds justify the convergence of the products and of their derivatives. Since
one obtains locally uniformly. Evaluating at one gets (18), and logarithmic differentiation gives
Next, let us compare the roots and . The coefficients of increase to those of , which gives uniform convergence on every closed disc strictly inside . Let us choose such that is the only zero of in . By Rouché’s theorem, for all sufficiently large the function has exactly one zero in this disc. It is the positive simple root , and . Put . The derivatives are uniformly bounded below near on the real axis, and the second derivatives are uniformly bounded there. The mean value theorem gives . Taylor expansion and (B.1) then yield
Thus , and expanding one obtains the estimate for .
The uniform estimate for the probability is obtained in the same way as in Theorem 6.1. On , is bounded below uniformly in large . Subtracting the simple pole and applying Cauchy’s formula one finds
uniformly in , and it remains to divide by the asymptotic formula for .
Finally, let us prove the distributional approximation. Put . We have and . For each fixed finite set of , both the probabilities and tend to zero; indeed , and the bounded-height generating function is analytic in a disc of radius larger than . For large one uses the uniform pole estimate and
Splitting the supremum into these two ranges one obtains the claim; the case is immediate, since for . For the last statement, let . At the exponential approximation tends to zero, whereas at it tends to one, which proves the bound.
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. Polychonakos, 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.DOI
- [4]L. Gan, S. Ouvry and A. P. Polychronakos, Combinatorics of generalized Dyck and Motzkin paths, Phys. Rev. E 106 (2022), 044123.DOI
- [5]S. Ouvry and A. P. Polychronakos, Hamiltonian and exclusion statistics approach to discrete forward-moving paths, Phys. Rev. E 104 (2021), 014143.DOI
- [6]I. Gahramanov and E. T. Musaev, Integrability properties of Motzkin polynomials, J. Math. Phys. 61 (2020), 033509.arxiv.org/abs/1706.00197
- [7]F. Aydogmus and M. Mullahasanoglu, Arithmetic selection rules in dispersionless Hamiltonian systems, arXiv:2608.11179 (2026).arxiv.org/abs/2608.11179
- [8]M. Mullahasanoglu, Liouville integrable binomial Hamiltonian system, J. Phys. Conf. Ser. 2667 (2023), 012041.arxiv.org/abs/2304.04500
- [9]P. Kucharski, M. Reineke, M. Stosić and P. Sułkowski, Knots-quivers correspondence, Adv. Theor. Math. Phys. 23 (2019), 1849–1902.DOI
- [10]M. Panfil, M. Stosić and P. Sułkowski, Donaldson-Thomas invariants, torus knots, and lattice paths, Phys. Rev. D 98 (2018), 026022.DOI
- [11]M. Stosić and P. Sułkowski, Torus knots and generalized Schröder paths, Nuclear Phys. B 1012 (2025), 116814.arxiv.org/abs/2405.10161
- [12]D. Đorđević and M. Stosić, Lattice paths and quiver generating series with higher level generators, arXiv:2408.01832 (2024).
- [13]A. Dwivedi and R. Pichai, Double twist knots and lattice paths, arXiv:2605.02786 (2026).arxiv.org/abs/2605.02786
- [14]C. Ji, Q. Tang and C. Yang, Schröder paths, their generalizations and knot invariants, arXiv:2407.20010 (2024).arxiv.org/abs/2407.20010
- [15]M. Stosić, Generalized knots-quivers correspondence, J. Knot Theory Ramifications 34 (2025), 25500053.arxiv.org/abs/2402.03066
- [16]P. Kucharski and D. Noschenko, Knot-quiver correspondence: a brief review, arXiv:2505.05668 (2025).arxiv.org/abs/2505.05668
- [17]P. Flajolet, Combinatorial aspects of continued fractions, Discrete Math. 32 (1980), 125–161.
- [18]P. Flajolet and R. Sedgewick, Analytic combinatorics, Cambridge University Press, Cambridge, 2009.
- [19]OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A143951.
- [20]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.arxiv.org/abs/2310.17026
- [21]D. Merlini, Generating functions for the area below some lattice paths, Discrete Math. Theor. Comput. Sci. Proc. AC (2003), 217–228.DOI
- [22]G. Gasper and M. Rahman, Basic hypergeometric series, 2nd ed., Cambridge University Press, Cambridge, 2004.