\documentclass[11pt,reqno]{amsart} \usepackage[margin=2.4cm]{geometry} \usepackage{amsmath,amssymb} \usepackage[final]{microtype} \usepackage{booktabs} \usepackage{tikz} \usepackage{xcolor} \definecolor{linkblue}{rgb}{0.0,0.2,0.55} \usepackage[colorlinks=true,linkcolor=linkblue,citecolor=linkblue,urlcolor=linkblue]{hyperref} \hypersetup{pdftitle={Height and limit laws for Riordan lattice paths of fixed area},pdfauthor={Ilmar Gahramanov}} \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{lemma}[theorem]{Lemma} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\area}{\operatorname{area}} \newcommand{\qb}[2]{\genfrac{[}{]}{0pt}{}{#1}{#2}_{q}} \title[Riordan lattice paths of fixed area]{Height and limit laws for Riordan lattice paths of fixed area} \author[Ilmar Gahramanov]{Ilmar Gahramanov$^{1,2}$} % affiliations and e-mail are printed below the author name on the first page; % the amsart end-of-paper address block is suppressed \makeatletter \def\@setaddresses{} \g@addto@macro\@setauthors{% \par\vspace{6pt}% {\centering\normalfont\small $^{1}$Department of Physics, Bo\u{g}azi\c{c}i University, 34342 Bebek, Istanbul, T\"urkiye\par \vspace{2pt}% $^{2}$Department of Mathematics, Khazar University, 41 Mehseti St., AZ1096 Baku, Azerbaijan\par \vspace{6pt}% E-mail: {\hypersetup{urlcolor=black}\href{mailto:ilmar.gahramanov@bogazici.edu.tr}{\texttt{ilmar.gahramanov@bogazici.edu.tr}}}\par}% } \makeatother \subjclass[2020]{Primary 05A16, 60C05; Secondary 05A15, 60G70, 33D15, 82B41} \keywords{Lattice path, Motzkin path, Riordan path, area statistic, fixed-area ensemble, height, limit law, $q$-series, continued fraction, staircase polygon} \begin{document} \begin{abstract} We study the maximum height $H_n$ of a uniformly chosen Riordan path of area $n$. Riordan paths are Motzkin paths without horizontal steps on the axis. Using the continued fraction for the area generating function, we obtain an exact product for the height tail of a primitive component. This gives the approximation $\mathbb P(H_n\le k)=\exp(-\Lambda n q_0^{(k+1)^2})+o(1)$, uniformly over nonnegative integer thresholds $k$, with explicit constants $q_0$ and $\Lambda$. The height is concentrated on two explicit adjacent integers of order $\sqrt{\log n}$, and the probabilities of the two heights have nontrivial limits along suitable subsequences. We also obtain exponential counting asymptotics, a signed partition recurrence and a joint Gaussian law for the numbers of returns, horizontal steps and up steps. \end{abstract} \maketitle \section{Introduction} Area-weighted lattice paths appear in models of directed polymers and vesicles \cite{OP12,PB95,Poly22}, in exclusion statistics \cite{Gan25,GOP22,OP21}, and in lattice-path formulations of knot invariants \cite{KRSS19,PSS18,SS25,DS24,DP26,JTY24,Stosic24,KN25}. Motzkin paths also label conserved quantities in certain integrable Hamiltonian systems \cite{GM20,AM26,Mul23}. Most of the probabilistic results in this area concern paths of fixed length, or polygons of fixed perimeter, where the area is a random variable with an Airy-type limit law \cite{Richard09}. Here we fix the area and choose a path uniformly at random. Recall that a \emph{Motzkin path} of length $n$ runs from $(0,0)$ to $(n,0)$ with steps $U=(1,1)$, $D=(1,-1)$ and $H=(1,0)$ and never passes below the $x$-axis. A \emph{Riordan path} is a Motzkin path with no horizontal steps on the axis, and a \emph{Dyck path} has no horizontal steps at all. A horizontal step on the axis does not change the area, so the Riordan condition is exactly what is needed for the number $r_n$ of paths of area $n$ to be finite. One has $r_n=1,2,4,9,20,45,101,\dots$ for $n=1,2,\dots$. A Riordan path of large area is a long sequence of small \emph{primitive} components, i.e.\ of pieces between consecutive returns to the axis. The largest of their heights is the height $H_n$ of the full path. We show (Theorem~\ref{thm:height}) that \begin{equation}\label{eq:intro-height} \sup_{k\in\mathbb Z_{\ge0}}\left|\mathbb P(H_n\le k)-\exp\!\left(-\Lambda n\,q_0^{(k+1)^2}\right)\right| \longrightarrow0\qquad(n\to\infty), \end{equation} with an explicit constant $\Lambda=3.9586573854\ldots$, and that \[ \mathbb P\bigl(H_n\in\{m_n-1,m_n\}\bigr)\longrightarrow1,\qquad m_n=\left\lfloor\sqrt{\frac{\log(\Lambda n)}{\log(1/q_0)}}+\frac12\right\rfloor \] (Corollary~\ref{cor:two-heights}). The smallest path of height $k+1$ is the pyramid $U^{k+1}D^{k+1}$ of area $(k+1)^2$, so a component of height larger than $k$ has probability of order $q_0^{(k+1)^2}$, and the height is determined by the balance between this probability and the number of components, which is of order $n$. The proof is based on the exact product formula \eqref{eq:tau}. Corollary~\ref{cor:two-heights} also describes how the probability splits between the two heights near a transition. The number of paths satisfies \[ r_n=Cq_0^{-n}\bigl(1+O(\theta^n)\bigr),\qquad q_0=0.4441165\ldots,\quad C=0.3431582\ldots, \] with $0<\theta<1$. The numbers of returns, horizontal steps and up steps satisfy a joint Gaussian limit law with explicit means and covariance (Corollary~\ref{cor:joint}). The area generating function of primitive Riordan paths is a specialization of the staircase-polygon generating function. Its functional equation, linearisation and ratio of $q$-series go back to Prellberg and Brak \cite{PB95}, Owczarek and Prellberg \cite{OP09,OP10,OP19} and Polychronakos \cite{Poly22}. We recall these results in Section~\ref{sec:fe} in a uniform notation and give the precise dictionary. Gaussian limit laws at fixed area are known for staircase polygons \cite{Richard09,FS09} and for locally restricted compositions \cite{BC05,BC09}. The latter include the positive height sequences of primitive Riordan paths, for which the largest part has order $\sqrt{\log n}$. The concentration of maxima of discrete random variables on two adjacent integers is a known phenomenon as well \cite{Anderson70,Seth03,Ott20}. What we add is the exact tail formula with its constant, the approximation \eqref{eq:intro-height}, which is uniform in $k$ under the fixed-area conditioning, and the explicit identification of the two heights. As by-products we obtain the constants of the Gaussian laws and a linear recurrence for $r_n$ whose coefficients are signed counts of partitions into distinct parts (Theorem~\ref{thm:rrec}). The rest of the paper is organized as follows. In Section~\ref{sec:def} we fix the notation. In Section~\ref{sec:fe} we recall the functional equation, the continued fraction and the closed form of the generating function, and compare them with the literature. In Section~\ref{sec:asym} we derive the asymptotics of $r_n$ and the partition recurrence. In Section~\ref{sec:limit} we study the limit laws of the additive statistics and of the height. The proof of the height theorem is given in Appendix~\ref{app:proof}, and explicit formulas for the area polynomials are collected in Appendices~\ref{app:poly} and~\ref{app:profile}.\footnote{Finite checks compare the polynomial recurrence and profile formula with direct enumeration through area $16$, and the partition recurrence with step-by-step counts through area $1500$. The Gaussian constants were evaluated independently and compared with exact moments at area $300$; the height probabilities in Table~\ref{tab:height} were also recomputed from exact counts. These checks complement the proofs below.} \section{Riordan paths and area polynomials}\label{sec:def} In this section we fix the notation and state the problem. We assign the weight $x$ to each up step and the weight $y$ to each horizontal step. A step from height $h$ to height $h'$ contributes $(h+h')/2$ to the area, i.e.\ an up or down step between heights $h$ and $h+1$ contributes $h+\tfrac12$, while a horizontal step at height $h$ contributes $h$. The total area is an integer, since the numbers of up and down steps are equal. Every allowed step contributes at least $\tfrac12$, so a Riordan path of area $n$ has length at most $2n$, and in particular there are only finitely many such paths. Summing the contributions of the two endpoints of each step one also finds \begin{equation}\label{eq:vertex} \area(P)=\sum_{h\ge1}h\,t_h, \end{equation} where $t_h$ is the number of interior vertices of $P$ at height $h$. Thus the area is the sum of the heights of the interior vertices.\footnote{This is the reason for excluding horizontal steps on the axis: a Motzkin path may contain arbitrarily many of them without changing the area.} For $n\ge1$ we define \begin{equation} S_n(x,y)=\sum_{\area(P)=n}x^{\#U(P)}\,y^{\#H(P)},\qquad S_0=1, \end{equation} where the sum runs over Riordan paths of area $n$, and $\#U(P)$ and $\#H(P)$ stand for the numbers of up and horizontal steps of $P$. A path with $i$ up steps and $j$ horizontal steps has weight $x^iy^j$ and length $2i+j$. One can easily compute the first polynomials, \begin{gather*} S_1=x,\qquad S_2=x^2+xy,\qquad S_3=x^3+2x^2y+xy^2,\qquad S_4=x^4+3x^3y+3x^2y^2+xy^3+x^2,\\ S_5=x^5+4x^4y+6x^3y^2+4x^2y^3+xy^4+2x^3+2x^2y, \end{gather*} and $S_6,\dots,S_{10}$ are listed in Appendix~\ref{app:poly}. For instance, the path $UHUDD$ in Figure~\ref{fig:path} has area $5$ and weight $x^2y$; it is one of the two paths giving the term $2x^2y$ of $S_5$. The numbers $r_n=S_n(1,1)$ of Riordan paths of area $n$ are, starting at $n=1$, \begin{equation}\label{eq:rn} 1,\ 2,\ 4,\ 9,\ 20,\ 45,\ 101,\ 227,\ 511,\ 1150,\ 2589,\ 5829,\ 13124,\ 29550,\ \dots \end{equation} with $r_0=1$. We denote the generating function by $F(x,y;q)=\sum_{n\ge0}S_n(x,y)q^n$, and we use the standard notation \[ (a;q)_n=(1-a)(1-aq)\cdots(1-aq^{n-1}),\qquad (a;q)_\infty=\prod_{j\ge0}(1-aq^j), \] with $(a;q)_0=1$ and $|q|<1$. For Dyck paths the numbers $S_n(1,0)$, $n\ge1$, are $1,1,1,2,3,4,6,9,\dots$; this is the sequence A143951 of \cite{OEIS}.\footnote{Enumeration at fixed area differs from the total area of all paths of a fixed length, which was studied in \cite{Bu23,Merlini03}.} \begin{figure}[htb] \centering \begin{tikzpicture}[scale=0.7] \draw[gray!25,very thin] (0,0) grid (5,2); \fill[blue!12] (0,0)--(1,1)--(2,1)--(3,2)--(4,1)--(5,0)--cycle; \draw[->,gray] (-0.3,0)--(5.6,0); \draw[->,gray] (0,-0.3)--(0,2.6); \draw[very thick,blue] (0,0)--(1,1)--(2,1)--(3,2)--(4,1)--(5,0); \foreach \p in {(0,0),(1,1),(2,1),(3,2),(4,1),(5,0)} \fill \p circle (2pt); \node[above] at (0.4,0.6) {$U$}; \node[above] at (1.5,1) {$H$}; \node[above] at (2.4,1.6) {$U$}; \node[above] at (3.6,1.6) {$D$}; \node[above] at (4.6,0.6) {$D$}; \end{tikzpicture} \caption{The path $UHUDD$, of area $\tfrac12+1+\tfrac32+\tfrac32+\tfrac12=5$.} \label{fig:path} \end{figure} \section{The generating function}\label{sec:fe} In this section we recall the functional equation, the continued fraction and the closed form of $F$. These results are not new: as explained in Sections~\ref{sec:staircase} and~\ref{sec:comparison}, they are elementary transforms of the results of Prellberg and Brak \cite{PB95}, Owczarek and Prellberg \cite{OP09,OP10,OP19} and Polychronakos \cite{Poly22}. We include short derivations in order to keep the paper self-contained and to fix the notation needed in Sections~\ref{sec:asym} and~\ref{sec:limit}. \subsection{The functional equation} If one lifts a path by one level, every step gains area $1$, so the area increases by the length of the path. Since a path of weight $x^iy^j$ has length $2i+j$, the lift is represented by the substitution $x\mapsto xq^2$, $y\mapsto yq$. In what follows we write $F^{\uparrow}=F(xq^2,yq;q)$. \begin{theorem}\label{thm:fe} The generating function satisfies \begin{equation}\label{eq:fe} F-1=q\,F^{\uparrow}\big[(x+y)F-y\big]. \end{equation} For $x\ne0$ this can be rearranged as \[ F(xq^2,yq;q)=\frac{F(x,y;q)-1}{q\,[(x+y)F(x,y;q)-y]}, \] with the factor $q$ cancelled formally. At $x=0$ one has $F=1$, and the undivided identity remains valid. \end{theorem} \begin{proof} A nonempty Riordan path starts with $U$. We read it up to the first subsequent step which either returns to the axis or is horizontal at height $1$. The segment $\hat R$ in between is a Riordan path lifted by one level and contributes $F^\uparrow$. If the distinguished step is $D$, one has $P=U\hat RDP'$ with an arbitrary Riordan path $P'$, which contributes $xqF^\uparrow F$. If the distinguished step is $H$, one has $P=U\hat RHW$, and removing $\hat RH$ leaves the nonempty Riordan path $UW$; this case contributes $yqF^\uparrow(F-1)$. Adding the two contributions one obtains \eqref{eq:fe}. \end{proof} For nonzero $x$, \eqref{eq:fe} is an equation of $q$-Riccati type: the lifted function $F^\uparrow$ is a linear fractional transform of $F$. For $y=0$ it reduces to the equation $F=1+xqF(xq^2)F$ for Dyck paths counted by area, which goes back to Flajolet \cite{Flajolet80}, see also \cite{OP12,FS09}. Nonlinear $q$-functional equations of this type for directed cluster models were studied systematically by Prellberg and Brak \cite{PB95}, and the Motzkin case with boundary weights was treated by Owczarek and Prellberg \cite{OP09,OP10,OP19} and by Polychronakos \cite{Poly22}. Extracting the coefficient of $q^n$ in \eqref{eq:fe} one obtains the following recurrence for the area polynomials, \begin{equation}\label{eq:rec} S_n=[t^{\,n-1}]\Big(\sum_{m0$. The factor $q^{\binom n2}$ therefore ensures local uniform convergence of the series for $A$ in $(z,q)$. 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 \[ \prod_{v\ge h}\bigl(1+|y|r^v+|x|r^{2v+1}\bigr)<\infty. \] The weights of configurations involving vertices beyond $k$ tend to zero uniformly on $|q|\le r$. Hence the finite continuants converge locally uniformly. Their formal limit, already identified above, is $A(q^h)$. The denominator in \eqref{eq:intro-closed} is holomorphic and equals $1$ at $q=0$, which proves the last assertion. \end{proof} \begin{remark}\label{rem:hermite} Write $x=\alpha\beta$ and $y=\alpha+\beta$. Then the solution of \eqref{eq:pn} takes the form \[ p_n=\sum_{k=0}^n\qb nk\alpha^{n-k}\beta^k, \] which is a homogeneous form of the continuous $q$-Hermite polynomial of Rogers: one has $p_n=x^{n/2}H_n(y/(2\sqrt{x})\mid q)$ for $x\ne0$, with its polynomial extension at $x=0$. Moreover, one can write \[ A(z)=(\alpha z;q)_\infty\;{}_1\phi_1\!\left(\begin{matrix}0\\ \alpha z\end{matrix};\,q,\,\beta z\right), \] which is a $q$-Bessel type function, see e.g.\ \cite{GR04}. At apparent singularities of the product representation, the identity is understood by analytic continuation. \end{remark} \subsection{Comparison with the literature}\label{sec:comparison} We now compare \eqref{eq:Afe}, \eqref{eq:pn} and \eqref{eq:intro-closed} with the known results. The passage from the nonlinear equation \eqref{eq:fe} to the linear $q$-difference equation \eqref{eq:Afe} is the linearisation method of Prellberg and Brak \cite[Section~4]{PB95}. They write the solution of a $q$-Riccati equation as a ratio $H(qx)/H(x)$, see Eqs.~(4.1) to (4.3) there, and for staircase polygons they obtain \[ S(a,b;q)=b\left[\frac{T(qa)}{T(a)}-1\right],\qquad T(a)=\sum_{n\ge0}\frac{(-qa)^nq^{\binom n2}}{(q;q)_n(qb;q)_n} ={}_1\phi_1\!\left(\begin{matrix}0\\ qb\end{matrix};\,q,\,qa\right), \] see \cite[Eqs.~(4.6) to (4.9)]{PB95} and \cite[Eqs.~(9), (10)]{OP19}. By the dictionary \eqref{eq:dictionary} this gives $F$ as well. In our notation, with $x=ab$ and $y=a+b$, Remark~\ref{rem:hermite} gives $A(q)=(bq;q)_\infty T(a)$, so that the denominators of the two representations agree up to an infinite product. The equation \eqref{eq:Afe} itself is Eq.~(4.2) of Owczarek and Prellberg \cite{OP09}. In their notation it reads $H(Z)+(Z-1)H(qZ)+qZ^2v^2H(q^2Z)=0$, and for $y\ne0$ one has $A(z)=H(yz)$ with $v^2=x/y^2$. Their coefficients $d_n$, defined in \cite[Eqs.~(4.5), (4.6)]{OP09}, are related to ours by $p_n=y^nd_n$, and \eqref{eq:pn} is their three-term recurrence. Finally, the double sum for $A$ which follows from Remark~\ref{rem:hermite}, \[ A(z)=\sum_{n\ge0}(-z)^nq^{\binom n2}\sum_{k=0}^{n} \frac{\alpha^{n-k}\beta^{k}}{(q;q)_{n-k}(q;q)_k}, \] is the secular determinant $F_\infty$ of Polychronakos for paths without a ceiling \cite[Eq.~(4.33)]{Poly22}. There the area of a step is defined in the same way as in Section~\ref{sec:def}, the up and down steps have weight $\mathsf z$ and the horizontal steps have weight $\mathsf z_h=\mathsf z(\omega+\omega^{-1})$. With $x=\mathsf z^2$ and $y=\mathsf z_h$, i.e.\ $\alpha=\mathsf z\omega$ and $\beta=\mathsf z\omega^{-1}$, one has \[ A(\zeta;x,y;q)=F_\infty(\zeta\mathsf z,\zeta\mathsf z_h;q), \] so that $A(1)$ is the determinant itself and $A(q^h)$ is the determinant with both weights multiplied by $q^h$. Then \eqref{eq:Afe} at $z=1$ is the expansion \cite[Eq.~(3.16)]{Poly22} at infinite height, and the Motzkin generating function $F/(1-yF)=A(q)/A(1)$ is \cite[Eq.~(3.12)]{Poly22}. Therefore the closed form \eqref{eq:intro-closed} is a restatement of known results in a notation adapted to the Riordan boundary condition. What we use from it below is the following: the meromorphic continuation of Lemma~\ref{lem:analytic}, the ratios $M_h=A(q^{h+1})/A(q^h)$ at all levels, which enter the height estimate of Section~\ref{sec:limit}, and the partition expansion of $A(q^h)$. \begin{remark}\label{rem:quiver} Since the exponent of $q$ in the above double sum is quadratic in $(n-k,k)$, the series $A$ can be read as the generating series of the symmetric quiver with adjacency matrix $\left(\begin{smallmatrix}1&1\\1&1\end{smallmatrix}\right)$, with the variables $\alpha zq^{-1/2}$ and $\beta zq^{-1/2}$, in the conventions of \cite{PSS18,SS25}. This is an identity of formal series only, and we do not know a knot invariant related to Riordan paths. \end{remark} For $y=0$, i.e.\ $\beta=-\alpha$, the closed form becomes the Rogers-Ramanujan type identity \begin{equation}\label{eq:dyck} F(x,0;q)=\frac{\sum_{k\ge0}(-x)^kq^{k(2k+1)}/(q^2;q^2)_k}{\sum_{k\ge0}(-x)^kq^{k(2k-1)}/(q^2;q^2)_k}, \end{equation} in agreement with \cite{OP12,FS09}. Finally, taking $k\to\infty$ in \eqref{eq:match} one obtains a second interpretation of the auxiliary series: for $h\ge1$, $A(q^h)$ enumerates partitions into distinct parts at least $h$, with each maximal run of $r$ consecutive parts weighted by $m_r(x,y)$. We will need this interpretation in Section~\ref{sec:asym}. \section{Asymptotics and a linear recurrence}\label{sec:asym} In this section we determine the growth of the numbers $r_n$ and obtain a recurrence for them. The point of departure is the decomposition of a path into its \emph{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 $x=y=1$ their generating function is \[ g(q)=\sum_{P\ \text{primitive}}q^{\area(P)}=q+q^2+q^3+2q^4+3q^5+5q^6+\cdots. \] Therefore $F(1,1;q)=1/(1-g)$ and, by \eqref{eq:intro-closed}, $g=qA(q^2)/A(q)$. Each primitive component contributes one return to the axis, including the final one, so marking the returns by $u$ one obtains $F(u;q)=1/(1-ug)=F/(u+(1-u)F)$. \begin{theorem}\label{thm:asym} Let $\rho$ be the radius of convergence of $g$. The equation $g(q)=1$ has a unique root $q_0\in(0,\rho)$, which is also the smallest positive root of $A(q)=qA(q^2)$ at $x=y=1$. For some $\theta<1$, \[ r_n=C\,q_0^{-n}\big(1+O(\theta^n)\big),\qquad C=\frac{1}{q_0\,g'(q_0)}, \] with \[ q_0=0.44411654605086\ldots,\quad q_0^{-1}=2.25166121121160\ldots,\quad C=0.34315827064\ldots \] \end{theorem} \begin{proof} The series $g$ has nonnegative coefficients and a positive radius of convergence, since a path of area $n$ has length at most $2n$. By Lemma~\ref{lem:analytic}, $g$ is meromorphic in $|q|<1$. The primitive paths $UH^jD$ give $g(t)\ge t/(1-t)$ wherever both sides converge, so $\rho\le1$. If $\rho<1$, Pringsheim's theorem together with meromorphicity implies that $\rho$ is a pole and $g(t)\to\infty$ as $t\uparrow\rho$. If $\rho=1$, the same divergence follows from the lower bound. Since $g$ is strictly increasing on $[0,\rho)$, it reaches $1$ at a unique point $q_0<\rho$. For $|q|\le q_0$ one has $|g(q)|\le g(|q|)\le1$. On $|q|=q_0$, equality in the triangle inequality requires the terms of degrees $1$ and $2$ to have the same argument, and their positive coefficients force $q=q_0$. Thus $1-g$ has a unique zero in the closed disc, and this zero is simple because $g'(q_0)>0$. Analyticity in a larger disc and isolation of zeros give an exponentially smaller remainder after subtraction of the simple pole, and the residue gives $C=1/(q_0g'(q_0))$. It remains to rule out a cancellation in the quotient for $g$. We display the base parameter of $A$ explicitly. If, for some $00$ for $0\le t<\rho$. On this interval the denominator is $A(q)(1-g(q))$, and its first positive zero is $q_0$. \end{proof} The leading asymptotics is already accurate at modest area; namely, $r_{22}/(Cq_0^{-22})=1+4.8722\cdot10^{-7}$. A further positive pole is found numerically at $q_1=0.77091704183\ldots$, and the argument principle applied numerically on the circles $|q|=0.6,\,0.7,\,0.8$ gives $1,1,2$ zeros of $A(q)-qA(q^2)$. These computations suggest that any $\theta\in(q_0/q_1,1)$ is admissible in Theorem~\ref{thm:asym}; we do not use this sharper, uncertified estimate. We do not know closed forms for $q_0$ and $C$; the Dyck constants $q_D=0.6629014851\ldots$ and $C_D=0.3377611503\ldots$ recorded in OEIS~A143951 \cite{OEIS} are likewise only known numerically. For positive weights $x,y$ the same argument applies whenever the primitive generating function reaches $1$ strictly inside its radius of convergence, which holds near $(x,y)=(1,1)$. \subsection{A recurrence for \texorpdfstring{$r_n$}{rn}} Let us now come back to the partition interpretation of Section~\ref{sec:comparison}. We write $A(q)|_{x=y=1}=\sum_n\nu_nq^n$ and $A(q^2)|_{x=y=1}=\sum_n\nu'_nq^n$. Then $\nu_n$ counts partitions of $n$ into distinct parts, with each maximal run of $r$ consecutive parts weighted by $m_r(1,1)=\sum_d(-1)^{r-d}\binom{r-d}d$, and $\nu'_n$ counts the same partitions with the additional restriction that every part is at least $2$. The run weights turn out to be periodic, namely $m_r(1,1)=1,-1,0$ for $r\equiv0,1,2\pmod3$, respectively. The following simple cancellation explains this periodicity. \begin{lemma}\label{lem:invol} Write a perfect monomer-dimer cover of the path with $r$ vertices as a word in the letters $M$ and $D$, with sign $(-1)^{\#\text{letters}}$. The map exchanging a leading $D$ with a leading $MM$, and fixing the words with neither prefix, is an involution which reverses the sign on its nonfixed pairs. Its fixed points are the words $MDw$, together with $M$ and the empty word. Hence $m_r(1,1)=m_{r-3}(1,1)$ for $r\ge3$, with the initial values $1,-1,0$. \end{lemma} \begin{theorem}\label{thm:rrec} Let $r_0=1$, set $\nu'_{-1}=0$, and let $d_n=\nu_n-\nu'_{n-1}$ for $n\ge0$. Then \[ r_n=\nu_n-\sum_{k=1}^{n}d_k\,r_{n-k},\qquad n\ge1, \] where $\nu_n=\sum_\lambda(-1)^{\#\{\text{runs of length}\equiv1\ (\mathrm{mod}\ 3)\}}$, the sum being over partitions $\lambda$ of $n$ into distinct parts with no run of length $\equiv2\pmod3$, and $\nu'_n$ is the same sum over partitions with parts $\ge2$. The first values are \begin{align*} (\nu_n)_{n\ge0}&=1,-1,-1,-1,0,0,2,1,2,2,1,0,1,-2,-2,-3,-3,-5,-3,-5,-3,\dots\\ (\nu'_n)_{n\ge0}&=1,0,-1,-1,-1,-1,0,0,1,2,2,2,3,2,1,1,0,-2,-2,-4,-5,\dots\\ (d_n)_{n\ge0}&=1,-2,-1,0,1,1,3,1,2,1,-1,-2,-1,-5,-4,-4,-4,-5,-1,-3,1,\dots \end{align*} \end{theorem} \begin{proof} This is the identity $F(1,1;q)\,(A(q)-qA(q^2))=A(q)$ written out coefficientwise. \end{proof} Lemma~\ref{lem:invol} and Theorem~\ref{thm:rrec} are related to the work of Polychronakos \cite{Poly22} as follows. With $x=\alpha\beta$ and $y=\alpha+\beta$ the run weights are \[ m_r(x,y)=(-1)^r\,\frac{\alpha^{r+1}-\beta^{r+1}}{\alpha-\beta}, \] and for $\alpha=z\omega$, $\beta=z\omega^{-1}$ this is the factor $(1-\omega^{2(r+1)})/(1-\omega^2)$ of the occupation-number expansion \cite[Eqs.~(4.34), (4.35)]{Poly22}, up to a monomial. For $\omega$ a root of unity these weights are periodic in $r$ and vanish periodically, see \cite[Eq.~(4.37)]{Poly22}; the point $x=y=1$ is the case $\omega=e^{i\pi/3}$ of period three. Thus the signed partition expansion behind Theorem~\ref{thm:rrec} is a reformulation of that determinant expansion. Lemma~\ref{lem:invol} gives a bijective proof of the periodicity, and the theorem records the resulting recurrence for the fixed-area counts. The coefficients of the recurrence are small compared with $r_n$, since their absolute values are bounded by partition counts; for example, $|\nu_n|\le1167$ for $n\le120$, whereas $r_{120}\approx10^{42}$. \section{Limit laws}\label{sec:limit} In this section we describe a typical Riordan path of large area. 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 $g(q_0)=1$, one can assign the probability $q_0^{\area(P)}$ to each primitive path $P$; this defines a probability distribution on primitive paths, which we call the Boltzmann distribution. Let $N$ be the area of a Boltzmann primitive path and let $R$ be an additive statistic, namely its number of returns, of horizontal steps or of up steps. One has $\mathbb E N=q_0g'(q_0)=1/C$, i.e.\ the constant $C$ of Theorem~\ref{thm:asym} is the inverse of the mean area of a primitive component. Let us first recall what is known about fixed-area ensembles. The perimeter of a staircase polygon chosen uniformly among the polygons of area $n$ is asymptotically Gaussian, see \cite[Chapter~IX]{FS09} and Section~3.6 of the survey of Richard \cite{Richard09}; the proof uses the ratio of two $q$-Bessel functions and the perturbation of a simple pole, which is also our tool in Theorem~\ref{thm:gauss}. In terms of the dictionary \eqref{eq:dictionary} that result concerns a single polygon with $a=b=1$, i.e.\ the coefficients of $G(1,2;q)$, whereas we consider sequences of primitive paths at $x=y=1$, i.e.\ the coefficients of $F(1,1;q)$. So the ensembles and the constants are different, but the method is the same. Moreover, a primitive Riordan path of area $n$ is the same as a composition of $n$ whose first and last parts are equal to $1$ and whose adjacent parts differ by at most one; the parts are the heights of the interior vertices. Such objects belong to the locally restricted compositions of Bender and Canfield \cite{BC05,BC09}, who proved, in a general setting, a central limit theorem for the number of parts and the order $\sqrt{\log n}$ for the largest part when the differences of adjacent parts are bounded. Thus the Gaussian laws and the scale of the height obtained below are expected from these general results. The much larger literature on paths of fixed length or polygons of fixed perimeter, where the area has an Airy-type limit \cite{Richard09}, concerns a different ensemble and serves here only as a context. \subsection{Additive statistics} We 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. \begin{theorem}\label{thm:gauss} Let a Riordan path of area $n$ be chosen uniformly at random, and let $X_n$, $Y_n$, $Z_n$ 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 $W_n$, \[ \mathbb E W_n=\mu n+O(1),\qquad \operatorname{Var}(W_n)=\sigma^2 n+O(1),\qquad \frac{W_n-\mu n}{\sigma\sqrt n}\ \xrightarrow{\ d\ }\ \mathcal N(0,1), \] where \begin{equation}\label{eq:renewal} \mu=\frac{\mathbb ER}{\mathbb EN},\qquad \sigma^2=\frac{\operatorname{Var}(R-\mu N)}{\mathbb EN}>0 . \end{equation} Numerically, \[ \begin{array}{lll} X_n:& \mu_X=C\approx0.343158270645,& \sigma_X^2\approx0.344199446374,\\ Y_n:& \mu_Y\approx0.365093862590,& \sigma_Y^2\approx0.292149839727,\\ Z_n:& \mu_Z\approx0.431620789070,& \sigma_Z^2\approx0.225725860430. \end{array} \] For the returns one has $\sigma_X^2=\operatorname{Var}(N)/(\mathbb EN)^3$. \end{theorem} \begin{proof} Let $g(v;q)$ be the generating function of primitive paths with the statistic marked by $v$. Then the bivariate generating function is $1/(1-g(v;q))$, i.e.\ we are dealing with the so-called supercritical sequence schema of Flajolet and Sedgewick \cite[Chapter~IX]{FS09}. Choose $r>q_0$ and $\varepsilon>0$ with $(1+\varepsilon)r<\rho$. Each statistic satisfies $0\le R\le N$, so the marked series is dominated by $g((1+\varepsilon)r)$ for $|q|\le r$, $|v|\le1+\varepsilon$, and is therefore jointly analytic for $|q|0$, and by continuity there is a neighbourhood $V$ of $v=1$ such that $|g(v;q)-g(1;q)|<\delta/2$ for $v\in V$ and $|q|=r$. By Rouch\'e's theorem, for every $v\in V$ the function $1-g(v;q)$ has exactly one zero $q(v)$ in the disc. Since $\partial_qg(1;q_0)=g'(q_0)>0$, the implicit function theorem shows that $q(v)$ is analytic and the zero is simple, after shrinking $V$ if necessary. Subtracting the pole at $q(v)$ and applying Cauchy's formula on the common contour $|q|=r$, where $|1-g(v;q)|\ge\delta/2$, one finds \[ [q^n]\frac{1}{1-g(v;q)}=c(v)\,q(v)^{-n}+O(r^{-n}),\qquad c(v)=\frac{1}{q(v)\,\partial_qg(v;q(v))}, \] uniformly for $v\in V$. Shrinking $V$ once more one has $|q(v)|\le r'q_0$ and $\varepsilon>0$ with $(1+\varepsilon)^3r<\rho$. As in the proof of Theorem~\ref{thm:gauss}, the simple pole persists at an analytic root $q(\mathbf v)$ near $q_0$, with coefficient asymptotics which are uniform for $\mathbf v$ in a neighbourhood of $\mathbf 1$. Consequently, for $\mathbf s$ near zero, \[ \mathbb E e^{\mathbf s^T\mathbf W_n} =\frac{c(e^{\mathbf s})}{C} \left(\frac{q_0}{q(e^{\mathbf s})}\right)^n \bigl(1+O(\theta^n)\bigr), \] where $c$ is analytic, $c(\mathbf1)=C$, and $\theta<1$. Differentiating $g(e^{\mathbf s};q(e^{\mathbf s}))=1$ gives the gradient $\boldsymbol\mu$ and the Hessian \eqref{eq:joint-cov} of $\log(q_0/q(e^{\mathbf s}))$ at zero. The Taylor expansion at $\mathbf s=i\mathbf t/\sqrt n$ gives the joint Gaussian limit; differentiation gives the covariance estimate. To check nondegeneracy, suppose $a+b\,\#H+c\,\#U=dN$ for every primitive path. Applying this relation to $UD$, $UHD$, $UUDD$ and $UUHDD$ gives \[ a+c=d,\qquad a+b+c=2d,\qquad a+2c=4d,\qquad a+b+2c=6d. \] These equations imply $a=b=c=d=0$. Thus no nonzero linear combination of $\mathbf R-\boldsymbol\mu N$ has zero variance, and $\Sigma$ is positive definite. \end{proof} \subsection{The height} We now turn to the height $H_n$, which is not additive. The height of a path is the maximum of the heights of its components, and a primitive component of height larger than $k$ is very rare under the Boltzmann distribution, since the smallest such path is the pyramid $U^{k+1}D^{k+1}$ of area $(k+1)^2$. Therefore the height of a path of area $n$ is determined by the balance between the number of components, which is of order $n$, and this small probability. To make this precise, for $k\ge1$ let $g^{[k]}$ be the generating function of primitive paths of height at most $k$, and let $q^{(k)}_0$ be the positive root of $g^{[k]}=1$ within its disc of convergence. We set $\lambda_k=\log(q^{(k)}_0/q_0)$ and $\tau_k=1-g^{[k]}(q_0)$, so that $\tau_k$ is the Boltzmann probability that a primitive path has height greater than $k$. The following theorem gives an exact formula for $\tau_k$ and the resulting law of the height. For a single primitive path of fixed area, the largest-part theorem of Bender and Canfield \cite{BC05} gives the scale $\sqrt{\log n}$. The theorem below gives the height distribution in the full Riordan ensemble. The concentration of the maximum of independent integer-valued random variables on two adjacent integers is also a known phenomenon. It goes back to Anderson \cite{Anderson70} and holds when the ratio of consecutive tail probabilities tends to zero, see Sethuraman \cite{Seth03} and Ottolini \cite{Ott20}. In our case $\tau_{k+1}/\tau_k\sim q_0^{2k+3}\to0$, so that the two-height concentration of Corollary~\ref{cor:two-heights} is an instance of this mechanism. What we add is the following: the exact product formula and the constant in the tail \eqref{eq:tau}, an approximation of the distribution function which is uniform in the threshold $k$ under the fixed-area conditioning, where the number of components is random and the components are not independent, and the explicit identification of the two heights. \begin{theorem}\label{thm:height} Let $M_h=A(q^{h+1})/A(q^h)$ and let $M^{(k)}_h$ be its truncation at height $k$. At $x=y=1$ one has, for $k\ge1$, \begin{equation}\label{eq:tau} \tau_k=q_0^{(k+1)^2}M_{k+1}(q_0) \prod_{h=1}^{k}M_h(q_0)M^{(k)}_h(q_0) \sim\frac{q_0^{(k+1)^2}}{A(q_0)^2}, \end{equation} and \[ \lambda_k=C\tau_k\bigl(1+O(k^2\tau_k)\bigr). \] There exist $k_0\in\mathbb N$, $0<\theta<1$ and constants $c_k\to C$ such that, uniformly in $k\ge k_0$, \[ \mathbb P(H_n\le k)=\frac{c_k}{C}e^{-\lambda_kn}+O(\theta^n). \] Consequently, with $\Lambda=C/A(q_0)^2=3.9586573854\ldots$, \[ \sup_{k\in\mathbb Z_{\ge0}} \left|\mathbb P(H_n\le k)-\exp\!\left(-\Lambda n q_0^{(k+1)^2}\right)\right| \longrightarrow0\qquad(n\to\infty), \] and \[ H_n=\sqrt{\frac{\log n}{\log(1/q_0)}}+O_{\mathbb P}(1). \] \end{theorem} The proof, which is based on an exact telescoping formula for $\tau_k$, is somewhat technical and is given in Appendix~\ref{app:proof}. \begin{corollary}\label{cor:two-heights} Put \[ b_n=\sqrt{\frac{\log(\Lambda n)}{\log(1/q_0)}},\qquad m_n=\left\lfloor b_n+\tfrac12\right\rfloor. \] Then $\mathbb P\bigl(H_n\in\{m_n-1,m_n\}\bigr)\to1$ as $n\to\infty$. For any $t>0$, if $(n_j)_{j\ge1}$ is a sequence of positive integers such that $\Lambda n_j q_0^{j^2}\to t$, then \[ \mathbb P(H_{n_j}=j-1)\longrightarrow e^{-t}, \qquad \mathbb P(H_{n_j}=j)\longrightarrow 1-e^{-t}. \] \end{corollary} \begin{proof} Write $a=\log(1/q_0)>0$. Since $|m_n-b_n|\le\tfrac12$, \[ b_n^2-(m_n-1)^2\ge b_n-\tfrac14,\qquad (m_n+1)^2-b_n^2\ge b_n+\tfrac14 \] for all sufficiently large $n$. In the approximation of Theorem~\ref{thm:height}, the exponent $\Lambda n q_0^{(k+1)^2}=\exp\{a[b_n^2-(k+1)^2]\}$ therefore tends to infinity at $k=m_n-2$ and to zero at $k=m_n$. Hence $\mathbb P(H_n\le m_n-2)\to0$ and $\mathbb P(H_n\le m_n)\to1$. For the subsequence statement, one may take $n_j$ to be the nearest positive integer to $(t/\Lambda)q_0^{-j^2}$. The condition on $n_j$ gives $b_{n_j}^2=j^2+(\log t)/a+o(1)$, so $m_{n_j}=j$ for all sufficiently large $j$. Theorem~\ref{thm:height} applied at $k=j-1$ gives $\mathbb P(H_{n_j}\le j-1)\to e^{-t}$. The two-height concentration then gives the asserted probabilities. \end{proof} \begin{remark} The double-exponential form in Theorem~\ref{thm:height} describes the distribution at integer thresholds only and should not be interpreted as a continuous Gumbel limit. Indeed, $(H_n+1)^2-L_n$ with $L_n=\log(\Lambda n)/\log(1/q_0)$ is not tight: choosing integers $n_m$ with $L_{n_m}=m^2+m+\tfrac12+o(1)$, every integer square is at distance at least $m+\tfrac12-o(1)$ from $L_{n_m}$. \end{remark} Numerically, one finds $\lambda_k=0.1185211$, $2.08134\cdot10^{-3}$, $8.14655\cdot10^{-6}$ and $5.82080\cdot10^{-9}$ for $k=1,\dots,4$, and exact bounded-height counts give the probabilities in Table~\ref{tab:height}. 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. \begin{table}[tb] \centering \caption{Height probabilities for a random Riordan path of area $n$, from exact bounded-height counts.}\label{tab:height} \smallskip \begin{tabular}{r@{\qquad}c@{\qquad}c@{\qquad}c} \toprule $n$ & $\mathbb P(H_n\le2)$ & $\mathbb P(H_n\le3)$ & $\mathbb P(H_n>4)$\\ \midrule 300 & 0.5451536770 & 0.9976892919 & $1.598915753\cdot10^{-6}$\\ 600 & 0.2919739476 & 0.9952539517 & $3.345151784\cdot10^{-6}$\\ 1500 & 0.0448558995 & 0.9879835406 & $8.583841582\cdot10^{-6}$\\ \bottomrule \end{tabular} \end{table} \section{Concluding remarks} We determined the asymptotics of the number of Riordan paths of fixed area, the joint Gaussian law for the additive statistics and the law of the height, using the known closed form of the generating function and the decomposition into primitive paths. The leading term of the tail of the height distribution is fixed by the area $(k+1)^2$ of the smallest path reaching height $k+1$, and the uniform estimate implies the concentration on two adjacent heights. The path decomposition and the continued fraction extend to horizontal steps $H_\ell=(\ell,0)$ with integer $\ell\ge1$, forbidden on the axis; the case $\ell=2$ gives Schr\"oder-type paths. Such a step at height $h$ has area $\ell h$. Writing $F_\ell^\uparrow=F_\ell(xq^2,yq^\ell;q)$, the functional equation takes the form \[ F_\ell-1=xqF_\ell^\uparrow F_\ell+yq^\ell F_\ell^\uparrow(F_\ell-1), \] and the continued fraction has $1-yq^{\ell h}$ in place of $1-yq^h$. The corresponding auxiliary function satisfies \[ A_\ell(z)=(1-yz^\ell)A_\ell(qz)-xqz^2A_\ell(q^2z),\qquad A_\ell(0)=1. \] For general $\ell$ the $q$-Hermite representation requires a separate analysis. At $x=y=1$ the growth constants for $\ell=1,2,3,4$ are $2.2516612$, $1.8656543$, $1.7182811$ and $1.6413284$; they decrease to the Dyck value $1.5085198\ldots$. To see this, we denote by $g_\ell$ and $g_D$ the generating functions of primitive paths with steps $H_\ell$ and of primitive Dyck paths at $x=y=1$, and by $q_\ell$ and $q_D$ the positive roots of $g_\ell=1$ and $g_D=1$. Increasing $\ell$ decreases the weight $q^{\ell h}$ of every horizontal step, so that $g_\ell(r)$ decreases and $q_\ell$ increases with $\ell$. By the analogue of \eqref{eq:skel}, a primitive Dyck skeleton with $m$ up steps has $2m-1$ interior vertices, all of positive height, and each of them carries a factor $1/(1-r^{\ell h})\le1/(1-r^\ell)$. Since the area of the skeleton is at least $2m-1$, one obtains \[ g_D(r)\le g_\ell(r)\le g_D\!\left(\frac{r}{1-r^\ell}\right) \] whenever the right-hand side converges. The first inequality gives $q_\ell\le q_D$. For a fixed $rr$ for all sufficiently large $\ell$. Hence $q_\ell\to q_D$. Several questions remain. The signed partition recurrence in Theorem~\ref{thm:rrec} 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~\ref{cor:joint}. It would be interesting to obtain similar uniform height estimates for other fixed-area ensembles, e.g.\ for Motzkin paths with a weight for the steps on the axis and for paths with several jump sizes. It also remains to understand whether the quiver form of Remark~\ref{rem:quiver} has a meaning beyond the algebraic identity. \subsection*{Acknowledgements} 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. The work of Ilmar Gahramanov is partially supported by the Istanbul Integrability and Stringy Topics Initiative (istringy.org). \appendix \section{The polynomials \texorpdfstring{$S_6,\dots,S_{10}$}{S6,...,S10}}\label{app:poly} Here we list the polynomials $S_6,\dots,S_{10}$; terms are grouped by decreasing total degree. \begin{align*} S_6&=x^6+5x^5y+10x^4y^2+10x^3y^3+5x^2y^4+xy^5+3x^4+6x^3y+3x^2y^2+x^2y\\ S_7&=x^7+6x^6y+15x^5y^2+20x^4y^3+15x^3y^4+6x^2y^5+xy^6\\ &\quad+4x^5+12x^4y+12x^3y^2+4x^2y^3+2x^3y+2x^2y^2+x^3\\ S_8&=x^8+7x^7y+21x^6y^2+35x^5y^3+35x^4y^4+21x^3y^5+7x^2y^6+xy^7\\ &\quad+5x^6+20x^5y+30x^4y^2+20x^3y^3+5x^2y^4+3x^4y+6x^3y^2+3x^2y^3+3x^4+3x^3y+x^2y^2\\ S_9&=x^9+8x^8y+28x^7y^2+56x^6y^3+70x^5y^4+56x^4y^5+28x^3y^6+8x^2y^7+xy^8\\ &\quad+6x^7+30x^6y+60x^5y^2+60x^4y^3+30x^3y^4+6x^2y^5\\ &\quad+4x^5y+12x^4y^2+12x^3y^3+4x^2y^4+6x^5+12x^4y+8x^3y^2+2x^2y^3+2x^3y+x^3\\ S_{10}&=x^{10}+9x^9y+36x^8y^2+84x^7y^3+126x^6y^4+126x^5y^5+84x^4y^6+36x^3y^7+9x^2y^8+xy^9\\ &\quad+7x^8+42x^7y+105x^6y^2+140x^5y^3+105x^4y^4+42x^3y^5+7x^2y^6\\ &\quad+5x^6y+20x^5y^2+30x^4y^3+20x^3y^4+5x^2y^5\\ &\quad+10x^6+30x^5y+33x^4y^2+16x^3y^3+3x^2y^4+6x^4y+6x^3y^2+x^2y^3+3x^4+2x^3y \end{align*} The numbers of paths of area $n$ with $r=1,2,\dots$ returns are, for $n=1,\dots,8$: $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$. \section{Explicit formulas for the coefficients}\label{app:profile} In this appendix we give explicit formulas for the coefficients of $S_n$. Deleting the horizontal steps of a Riordan path leaves its Dyck \emph{skeleton}. Conversely, one can insert an arbitrary run of horizontal steps at each skeleton vertex $v$ of positive height $h(v)$. Each inserted step has weight $yq^{h(v)}$, and therefore \begin{equation}\label{eq:skel} F=\sum_{D\ \mathrm{Dyck}}x^{\#U(D)}q^{\area(D)}\prod_{v}\frac1{1-yq^{h(v)}}, \end{equation} where the product runs over the vertices of $D$ of positive height. For fixed $m$, the coefficient $F_m=[x^m]F$ is a rational function of $q$ whose denominator divides $\prod_{h=1}^m(1-yq^h)^{m+1-h}$. For example, $F_1=q/(1-yq)$ and $F_2=\frac{q^2}{(1-yq)^2}+\frac{q^4}{(1-yq)^2(1-yq^2)}$. In particular, the paths of height one contribute exactly $x(x+y)^{n-1}$ to $S_n$, which is the leading row visible in Appendix~\ref{app:poly}. In order to obtain a positive formula for all coefficients, we will need also the following profiles. Theorem~\ref{thm:profile} below is a specialisation of the results of Gan, Ouvry and Polychronakos \cite{GOP22}. The Dyck skeleton count is the lowest-floor case of \cite[Eq.~(18)]{GOP22}, and the Motzkin profile formulas of \cite[Sections~5.2 and 5.3]{GOP22} count periodic paths and paths starting from a given floor with prescribed numbers of up and horizontal steps at each level. Restricting their product to excursions with no horizontal steps on the lowest floor and passing from horizontal-step numbers to vertex numbers one obtains the product of Theorem~\ref{thm:profile}, which can be written equivalently as \[ \prod_{h=1}^{H}\frac{(t_h-1)!}{(t_h-u_{h-1}-u_h)!\,u_h!\,(u_{h-1}-1)!}\,. \] We include a short direct proof in order to make the fixed-area constraint explicit. For a path $P$, let $t_h$ be the number of its interior vertices at height $h$, and let $u_h$ be the number of its up steps from height $h$ to $h+1$. Recall that the area is given by \eqref{eq:vertex}. If $P$ has height $H$, its up-profile $(u_0,\dots,u_{H-1})$ is a composition of $\#U(P)$, and its skeleton has $v_h=u_{h-1}+u_h$ vertices at each height $1\le h\le H$, where $u_H=0$. \begin{theorem}\label{thm:profile} Let $u=(u_0,\dots,u_{H-1})$ be a composition and let $t=(t_1,\dots,t_H)$ be a sequence of positive integers, and set $u_H=0$. Here a binomial coefficient is zero when its lower argument exceeds its nonnegative upper argument. The number of Riordan paths with up-profile $u$ and vertex profile $t$ is \[ \prod_{h=1}^{H}\binom{u_{h-1}+u_h-1}{u_h}\binom{t_h-1}{u_{h-1}+u_h-1}. \] Consequently, \[ F=1+\sum_{u}x^{|u|}\prod_{h=1}^{H}\binom{u_{h-1}+u_h-1}{u_h}\Big(\frac{q^h}{1-yq^h}\Big)^{u_{h-1}+u_h}, \] where the sum runs over all nonempty compositions $u$ and $H$ denotes the number of parts. For $m\ge1$, the number of paths of area $n$ with $m$ up steps and $j$ horizontal steps is \[ c(n,m,j)=\sum_{\substack{u\models m,\ t\\ \sum_ht_h=2m-u_0+j,\ \sum_hh\,t_h=n}} \ \prod_{h=1}^{H}\binom{u_{h-1}+u_h-1}{u_h}\binom{t_h-1}{u_{h-1}+u_h-1}. \] \end{theorem} \begin{proof} We first count the Dyck skeletons with profile $u$. At level $h$, the $u_h$ excursions above height $h$ are distributed among the $u_{h-1}$ excursions rising from height $h-1$. This is a weak composition into $u_{h-1}$ parts, counted by $\binom{u_{h-1}+u_h-1}{u_h}$, and applying this construction at successive levels one obtains the first factor. Next, at height $h$, one distributes $t_h-v_h$ horizontal steps among the $v_h$ skeleton vertices; there are $\binom{t_h-1}{v_h-1}$ choices, which gives the second factor. The area is then determined by \eqref{eq:vertex}. Since the skeleton has $u_0$ primitive components, exactly $u_0-1$ of its interior vertices lie on the axis, and therefore it has $2m-u_0$ vertices of positive height. Inserting $j$ horizontal steps gives $\sum_{h=1}^{H}t_h=2m-u_0+j$, which proves the formula for $c(n,m,j)$. Summing over the insertions at each height one obtains the generating function, where the term $1$ represents the empty path. \end{proof} \section{Proof of Theorem~\ref{thm:height}}\label{app:proof} \begin{proof}[Proof of Theorem~\ref{thm:height}] We first prove the formula for $\tau_k$. Write $T_k(q)=g(q)-g^{[k]}(q)$ and $\delta_h=M_h-M^{(k)}_h$. Subtracting the recursions for $M_h$ and $M^{(k)}_h$, with $M^{(k)}_{k+1}=0$, one finds \[ \delta_h=q^{2h+1}M_hM^{(k)}_h\delta_{h+1},\qquad \delta_{k+1}=M_{k+1}. \] Since $g=qM_1$, iteration gives \[ T_k(q)=q^{(k+1)^2}B_k(q),\qquad B_k(q)=M_{k+1}(q)\prod_{h=1}^{k}M_h(q)M^{(k)}_h(q). \] The exponent $1+\sum_{h=1}^k(2h+1)=(k+1)^2$ is precisely the area of the pyramid of height $k+1$. To make the uniformity explicit, we fix $r$ with $q_0q_0$, and the bounded-height generating function is analytic in a disc of radius larger than $q_0$. For large $k$ one uses the uniform pole estimate and \[ \sup_{t\ge0}|e^{-(1+\epsilon)t}-e^{-t}|\longrightarrow0 \quad\text{as }\epsilon\to0. \] Splitting the supremum into these two ranges one obtains the claim; the case $k=0$ is immediate, since $\mathbb P(H_n\le0)=0$ for $n\ge1$. For the last statement, let $b_n=\sqrt{\log(\Lambda n)/\log(1/q_0)}$. At $k=\lfloor b_n\rfloor-2$ the exponential approximation tends to zero, whereas at $k=\lfloor b_n\rfloor+1$ it tends to one, which proves the $O_{\mathbb P}(1)$ bound. \end{proof} \begin{thebibliography}{99} \bibitem{OP12} A.~L.~Owczarek and T.~Prellberg, Enumeration of area-weighted Dyck paths with restricted height, Australas. J. Combin. \textbf{54} (2012), 13--18. \bibitem{PB95} T.~Prellberg and R.~Brak, Critical exponents from nonlinear functional equations for partially directed cluster models, J. Stat. Phys. \textbf{78} (1995), 701--730. \bibitem{Poly22} A.~P.~Polychronakos, Length and area generating functions for height-restricted Motzkin meanders, Phys. Rev. E \textbf{105} (2022), 024102. \bibitem{Gan25} L.~Gan, Lattice random walks and quantum A-period conjecture, SciPost Phys. \textbf{19} (2025), 053. \bibitem{GOP22} L.~Gan, S.~Ouvry and A.~P.~Polychronakos, Combinatorics of generalized Dyck and Motzkin paths, Phys. Rev. E \textbf{106} (2022), 044123. \bibitem{OP21} S.~Ouvry and A.~P.~Polychronakos, Hamiltonian and exclusion statistics approach to discrete forward-moving paths, Phys. Rev. E \textbf{104} (2021), 014143. \bibitem{KRSS19} P.~Kucharski, M.~Reineke, M.~Sto\v si\'c and P.~Su\l kowski, Knots-quivers correspondence, Adv. Theor. Math. Phys. \textbf{23} (2019), 1849--1902. \bibitem{PSS18} M.~Panfil, M.~Sto\v si\'c and P.~Su\l kowski, Donaldson-Thomas invariants, torus knots, and lattice paths, Phys. Rev. D \textbf{98} (2018), 026022. \bibitem{SS25} M.~Sto\v si\'c and P.~Su\l kowski, Torus knots and generalized Schr\"oder paths, Nuclear Phys. B \textbf{1012} (2025), 116814. \bibitem{DS24} D.~\DJ or\dj evi\'c and M.~Sto\v si\'c, Lattice paths and quiver generating series with higher level generators, arXiv:2408.01832 (2024). \bibitem{DP26} A.~Dwivedi and R.~Pichai, Double twist knots and lattice paths, arXiv:2605.02786 (2026). \bibitem{JTY24} C.~Ji, Q.~Tang and C.~Yang, Schr\"oder paths, their generalizations and knot invariants, arXiv:2407.20010 (2024). \bibitem{Stosic24} M.~Sto\v si\'c, Generalized knots-quivers correspondence, J. Knot Theory Ramifications \textbf{34} (2025), 2550053. \bibitem{KN25} P.~Kucharski and D.~Noshchenko, Knot-quiver correspondence: a brief review, arXiv:2505.05668 (2025). \bibitem{GM20} I.~Gahramanov and E.~T.~Musaev, Integrability properties of Motzkin polynomials, J. Math. Phys. \textbf{61} (2020), 033509. \bibitem{AM26} F.~Aydogmus and M.~Mullahasanoglu, Arithmetic selection rules in dispersionless Hamiltonian systems, arXiv:2608.11179 (2026). \bibitem{Mul23} M.~Mullahasanoglu, Liouville integrable binomial Hamiltonian system, J. Phys. Conf. Ser. \textbf{2667} (2023), 012041. \bibitem{Richard09} C.~Richard, Limit distributions and scaling functions, in \emph{Polygons, polyominoes and polycubes}, Lecture Notes in Phys. \textbf{775}, Springer, Dordrecht, 2009, 247--299. \bibitem{OP09} A.~L.~Owczarek and T.~Prellberg, Exact solution of the discrete $(1+1)$-dimensional RSOS model with field and surface interactions, J. Phys. A \textbf{42} (2009), 495003. \bibitem{OP10} A.~L.~Owczarek and T.~Prellberg, Exact solution of the discrete $(1+1)$-dimensional RSOS model in a slit with field and wall interactions, J. Phys. A \textbf{43} (2010), 375004. \bibitem{OP19} A.~L.~Owczarek and T.~Prellberg, Exact solution of pulled, directed vesicles with sticky walls in two dimensions, J. Math. Phys. \textbf{60} (2019), 033301. \bibitem{FS09} P.~Flajolet and R.~Sedgewick, \emph{Analytic combinatorics}, Cambridge University Press, Cambridge, 2009. \bibitem{BC05} E.~A.~Bender and E.~R.~Canfield, Locally restricted compositions I. Restricted adjacent differences, Electron. J. Combin. \textbf{12} (2005), \#R57. \bibitem{BC09} E.~A.~Bender and E.~R.~Canfield, Locally restricted compositions II. General restrictions and infinite matrices, Electron. J. Combin. \textbf{16} (2009), \#R108. \bibitem{Anderson70} C.~W.~Anderson, Extreme value theory for a class of discrete distributions with applications to some stochastic processes, J. Appl. Probab. \textbf{7} (1970), 99--113. \bibitem{Seth03} J.~Sethuraman, A clustering law for some discrete order statistics, J. Appl. Probab. \textbf{40} (2003), 226--241. \bibitem{Ott20} A.~Ottolini, Oscillations for order statistics of some discrete processes, J. Appl. Probab. \textbf{57} (2020), 703--719. \bibitem{OEIS} OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, \url{https://oeis.org/A143951}. \bibitem{Bu23} A.~J.~Bu, Explicit generating functions for the sum of the areas under Dyck and Motzkin paths (and for their powers), Discrete Math. Lett. \textbf{14} (2024), 1--6. \bibitem{Merlini03} D.~Merlini, Generating functions for the area below some lattice paths, Discrete Math. Theor. Comput. Sci. Proc. \textbf{AC} (2003), 217--228. \bibitem{Flajolet80} P.~Flajolet, Combinatorial aspects of continued fractions, Discrete Math. \textbf{32} (1980), 125--161. \bibitem{GR04} G.~Gasper and M.~Rahman, \emph{Basic hypergeometric series}, 2nd ed., Cambridge University Press, Cambridge, 2004. \end{thebibliography} \end{document}