{"id":"3e6be16d-3ac9-43e1-b7a5-55717fa2c99e","arxiv_id":"2506.08407","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper derives closed-form formulas, via Riordan arrays and Lagrange inversion, for the number of points, up-steps, peaks, and udu-steps in r-colored Dyck paths with no same-colored consecutive down-steps.","lead":"This paper counts four statistics of colored Dyck paths where consecutive down-steps must have different colors, namely the number of points at each level, the number of up-steps at each level, the number of peaks, and the number of udu-steps. It derives explicit closed-form formulas for these counts.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the last-return bijection is valid and the recurrences, Riordan/Lagrange steps, and Theorem 6.1 insertion bijection are internally consistent.","rationale":"The paper's central claims are four explicit enumeration formulas. I checked the decomposition argument that the reader singled out as the weakest assumption. It is valid: the last return decomposition D = D1 u D2 d_j is bijective, and the color-constraint interaction is fully captured by the r-1 versus r distinction depending on whether D2 is empty. No cross-boundary same-color d-d pair can occur because the u-steps are uncolored and separate D1 from D2, and when D2 is empty the step before d_j is u. I also verified that the recurrences in Sections 3-5 are internally consistent by reconstructing the generating-function equations, including the separate treatment of the n = 0 term, and confirmed that the Riordan-array/Lagrange-inversion steps yield the stated binomial sums. Spot checks for r = 2 and r = 3 against the tables agree. The least explicit part, Theorem 6.1, has a terse combinatorial proof, but the insertion operation preserves the color constraint and the multiset count binom(n-1,ell) is correct; the small table entries match (6.1)-(6.2). I therefore find no load-bearing correctness concern. The CONDITIONAL verdict remains reasonable only insofar as the editors may want fuller proofs for the 'similarly' derived recurrences and for the unproved Section 7 statements, but those are completeness issues, not flaws in the central argument.","tokens_in":22074,"tokens_out":37392,"duration_ms":423325,"concrete_test":"Brute-force enumerate A_{n,0}^{(r)} for r = 2, 3 and n <= 7, computing directly the four statistics (points at level ell, u-steps at level ell+1, peaks at level ell+1, and udu-steps), and compare every entry of Tables 3.1-6.2 against Theorems 3.1, 4.1, 5.1, and 6.1; if any entry disagrees, the recurrences or the Theorem 6.1 insertion bijection contain a hidden error.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No significant objection identified. The last-return decomposition D = D1 u D2 d_j is a genuine bijection for A_{n+1,0}^{(r)}: if D2 is nonempty its last step is a down-step immediately preceding d_j, so the no-equal-color rule forces exactly r-1 choices for d_j; if D2 is empty, d_j is preceded by the uncolored up-step u, yielding r choices. Because u-steps are uncolored, the boundaries D1/u and u/D2 cannot create new same-color d-d pairs, so D1 and D2 independently range over A_{k,0}^{(r)} and A_{n-k,0}^{(r)}. The recurrences (3.1)-(3.3), (4.1)-(4.2), and (5.1)-(5.2) consistently encode the two return-color cases, including the D2-empty corrections such as the extra S_n and P_{n,1} terms in (3.2); the resulting generating-function equations and Lagrange-inversion coefficient extractions reproduce the printed tables. The least detailed argument is Theorem 6.1, but it also withstands inspection: inserting d_j u after an up-step endpoint creates no d-d adjacency, so the color constraint is automatically preserved, and counting multisets of size ell from n-ell up-step endpoints gives binom(n-1,ell), which matches the table values. The reader's flagged weakest assumption is therefore not a soft spot, and the deferred justifications in Sections 5 and 7 do not affect the correctness of the central formulas.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies the set A_{n,0}^{(r)} of r-colored Dyck paths of semilength n with no two consecutive down-steps sharing a color. The authors derive explicit enumeration formulas for four statistics: the total number of points at level ℓ (Theorem 3.1), the number of up-steps at level ℓ+1 (Theorem 4.1), the number of peaks at level ℓ+1 (Theorem 5.1), and the number of udu-steps (Theorem 6.1). The first three statistics are expressed as entries of Riordan arrays built from S_r(x), the generating function for these paths, and are converted into closed binomial sums via Lagrange inversion. Theorem 6.1 gives the product formula T_{n,ℓ}^{(r)} = binom(n-1,ℓ) T_{n-ℓ,0}^{(r)} r^ℓ, with T_{n,0}^{(r)} given as a binomial sum. Several corollaries record alternating-sum identities, and Section 7 states generalizations to (a,b)-Dyck paths without proofs.","tokens_in":22440,"tokens_out":39880,"duration_ms":381969,"significance":"The main formulas are new and the Riordan-array framework is elegant, connecting the statistics to (a,b)-Schröder numbers. The proofs are based on a sound last-return decomposition and standard Riordan-array and Lagrange-inversion techniques; the recurrences are stated in enough detail that the small table values can be checked by hand. The paper is honest in scope: no parameters are fitted, and the results are derived from the recursive structure of the class. The explicit formulas and tables will be useful to researchers in enumerative combinatorics. The main proofs are essentially complete; the gaps are in supporting material rather than in the central claims.","major_comments":[],"minor_comments":[{"comment":"The proof of Lemma 2.2 establishes (2.2) for Z_1 but then says that (2.3) follows 'by induction on m' with the detail left to the reader; since (2.5) and Corollaries 4.2, 4.3, and 5.2 depend on this lemma, please include the induction step or at least a full outline.","section":"Lemma 2.2"},{"comment":"Theorems 7.1-7.3 are stated without proofs, with the note that 'the detailed proofs are omitted'; please either provide proofs or sketches, or clearly re-label these as remarks rather than theorems.","section":"Section 7"},{"comment":"In the Lagrange inversion steps, the transition from the coefficient-of-S_r expression to the final binomial sum is not shown, and in Theorem 5.1 even the intermediate Lagrange expression is omitted; please add at least one example of the binomial simplification, and for Theorem 5.1 include the intermediate coefficient expression.","section":"Theorems 3.1, 4.1, 5.1"},{"comment":"The notation A_{n,k}^{(r)} is used both for the set of paths and for its cardinality, for instance in Section 2; please introduce separate notation for the set and the number, or state explicitly that the meaning is clear from context.","section":"Throughout"},{"comment":"There are several typographical errors: 'well-kown' on page 3, 'determinated' in Theorem 6.1, 'Enumberative Combinatorics' in reference [49], and 'nodd-steps' in the sentence near (2.5).","section":"General"}],"recommendation":"minor_revision","confidential_remarks":"The paper overlaps in method with the authors' previous Riordan-array papers, but the target class and statistics are new and the central formulas are not circular. The main concern is the number of omitted proofs and derivations; asking the authors to fill these in during revision would strengthen the paper without changing its scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Worth a look if you care about lattice-path enumeration. The paper studies r-colored Dyck paths with no same-colored consecutive down-steps, and gives explicit closed forms for four statistics: points at level ℓ, up-steps at level ℓ+1, peaks at level ℓ+1, and udu-steps. The path class is natural, the formulas are new, and the Riordan-array packaging is elegant. Lemma 2.2, the algebraic identity for S(a,b;x), is a genuine new tool and drives everything cleanly.\n\nThe recurrences are explicit and the small tables match the closed forms, which I checked for a few values. The last-return decomposition D = D1 u D2 d_j is valid: the color constraint only affects the color count of the final down-step, giving r−1 choices when D2 is nonempty and r when it is empty. The stress-test note is right that the reader's flagged \"weakest assumption\" is not actually a soft spot. The generating-function equations in Sections 3–5 are internally consistent, and the Lagrange-inversion coefficient extraction reproduces the printed tables.\n\nThe real soft spots are the places where the authors say \"the detail is omitted\" or \"left to the interested readers.\" Lemma 2.2's induction, Theorem 5.1's coefficient extraction, and the proofs of several corollaries are skipped. That is common in this subfield and not disqualifying, but for a journal submission I would want those filled in or at least sketched. Section 7 states generalizations to (a,b)-Dyck paths without proofs; that is fine as a remark, but the statements should be clearly flagged as unproven rather than presented as theorems with omitted proofs.\n\nThis is not a groundbreaking paper, but it is a solid new application of a standard method, and the main results appear correct. The citation pattern is reasonable; the authors cite their own previous work where it supplies templates, and the r=2 reductions to Schröder numbers are noted. No circularity or invented entities.\n\nWho is it for: enumerative combinatorists who work with Dyck/Motzkin/Schröder paths and Riordan arrays. They will find this useful and may extend it. It deserves a serious referee. My recommendation: accept after minor revision, with the omitted derivations supplied and Section 7's unproved items labeled as such.","headline":"Solid, competent Riordan-array enumeration of four statistics on a natural new class of colored Dyck paths; the formulas look right and the last-return decomposition is sound, but several proof details are skipped.","tokens_in":22942,"tokens_out":1522,"would_cite":true,"duration_ms":20296,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A15","05A10","05A19"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves explicit closed-form formulas for four statistics on r-colored Dyck paths with no two consecutive down-steps sharing a color, with the first three encoded as Riordan arrays and the fourth as a product formula.","keywords":["r-colored Dyck paths","no equal-color dd-steps","Riordan array","(a,b)-Schröder paths","Lagrange inversion","lattice path statistics","udu-steps","closed-form enumeration"],"falsifier":"Enumerate all 3-colored Dyck paths of length 8 (that is, $n=4$) with no two consecutive down-steps of the same color, and count the total number of points at level 2. The formula in Theorem 3.1 evaluates to $P_{4,2}^{(3)}=1128$; if a complete direct enumeration gives any other number, the last-return decomposition used in the proof is not a bijection and the Riordan-array formulas fail.","tokens_in":21908,"feed_emoji":"🧮","tokens_out":11654,"duration_ms":110050,"temperature":0.7,"pith_summary":"The paper works with the set $\\mathcal{A}_{n,0}^{(r)}$ of $r$-colored Dyck paths of length $2n$ in which consecutive down-steps never have the same color, and it derives explicit counting formulas for four statistics: the number of points at level $\\ell$, the number of up-steps at level $\\ell+1$, the number of peaks at level $\\ell+1$, and the number of $udu$-steps. For the first three statistics the counts are given as finite binomial sums, and the triangles of counts are shown to be entries of Riordan arrays whose second component is always $x(r-1)S_r(x)^2$, where $S_r(x)=S(1,r-1;x)$ is the generating function of weighted $(1,r-1)$-Schröder paths. For the fourth statistic the paper proves the product formula $T_{n,\\ell}^{(r)}=\\binom{n-1}{\\ell}T_{n-\\ell,0}^{(r)}r^{\\ell}$ and gives an explicit sum for the $\\ell=0$ case. A closing section transfers the three Riordan-array results to weighted $(a,b)$-Dyck paths. A sympathetic reader would care because the formulas turn a neighborhood-restricted path model into concrete, checkable numbers rather than a bare recurrence.","feed_headline":"Exact formulas cover four statistics of color-restricted Dyck paths","feed_subtitle":"Points, up-steps, peaks, and udu's are pinned down by Riordan arrays and one product formula.","key_machinery":"The machinery is the last-return decomposition combined with a Riordan-array representation. A Riordan array is an infinite lower-triangular matrix whose $k$-th column has generating function $d(x)h(x)^k$; here the second component is always $h(x)=x(r-1)S_r(x)^2$, and the first component changes by statistic. The function $S_r(x)=S(1,r-1;x)$ is the weighted generating function of $(1,r-1)$-Schröder paths and satisfies $S_r(x)=1+xS_r(x)+x(r-1)S_r(x)^2$, which is the quadratic that Lagrange inversion turns into binomial sums. The auxiliary Lemma 2.2 packages a nested composition $Z_m(a,b;x)=S\\left(-a,\\frac{b^{2m}}{a^{2m-1}};x\\right)$ and yields the identity $S_r(x)S_r\\left(-x(r-1)S_r(x)^2\\right)=S(1,-(r-1)^2;x)$ used for the corollaries. For the $udu$ statistic the load-bearing object is the generating function $T_0(x)$ of $udu$-avoiding paths, whose quadratic functional equation encodes the three forms $\\varepsilon$, $ud_j$, and $uD_1d_jD_2$.","core_discovery":"The central claim is that the generating function $S_r(x)=S(1,r-1;x)$ carries the entire enumeration. After the last-return decomposition $D=D_1uD_2d_j$ with $D_1,D_2\\in\\mathcal{A}_{\\cdot,0}^{(r)}$, the color rule forces exactly $r-1$ choices for the final down-step $d_j$ when $D_2$ is nonempty and $r$ choices when $D_2$ is empty; summing over this decomposition gives recurrences that solve to the Riordan-array identities: the point counts satisfy $P_{n,\\ell}^{(r)}+\\frac{1}{r-1}\\delta_{n,0}$ as the $(n,\\ell)$-entry of $\\left(S_r(x)^2+\\frac{1}{r-1},\\,x(r-1)S_r(x)^2\\right)$, the up-step counts are the entries of $\\left(S_r(x)^2(1+(r-1)S_r(x)),\\,x(r-1)S_r(x)^2\\right)$, and the peak counts are the entries of $\\left(rS_r(x)^2,\\,x(r-1)S_r(x)^2\\right)$. Lagrange inversion applied to $S_r(x)=1+xS_r(x)+x(r-1)S_r(x)^2$ converts each Riordan entry into the displayed binomial sum. For $udu$-steps the paper proves a bijective deletion argument: deleting the $d_ju$ steps of each $udu$ occurrence sends a path with $\\ell$ $udu$'s to a $udu$-avoiding path, each choice of an endpoint contributing a factor $r$, giving $T_{n,\\ell}^{(r)}=\\binom{n-1}{\\ell}T_{n-\\ell,0}^{(r)}r^{\\ell}$, with $T_{n,0}^{(r)}$ itself extracted by Lagrange inversion from the quadratic $T_0(x)=1+rx-(r-1)xT_0(x)+(r-1)xT_0(x)^2$.","pith_inferences":["Because the only input to the recurrences is the last-return decomposition and the choice counts $r$/$r-1$, the same proof should work for the variant that forbids equal colors on runs of down-steps of length at most $k$, yielding a family of Riordan arrays parameterized by $k$.","The product formula for $udu$-steps suggests a direct bijective proof of the whole distribution: choose $\\ell$ of the $n-1$ up-step endpoints, insert colored $d_ju$ pairs, and keep the $udu$-avoiding core; this could be exported to Motzkin or Schröder analogues.","The Riordan-array formulation raises natural positivity questions: the tables in Sections 3-5 are likely totally positive, which would imply log-concavity or unimodality of each row as $\\ell$ varies, a property not stated in the paper.","The functional identity $S_r(x)S_r\\left(-x(r-1)S_r(x)^2\\right)=S(1,-(r-1)^2;x)$ is the kind of self-composition relation that often signals an underlying orthogonal-polynomial or continued-fraction structure; testing small $r$ for such a representation is a natural next step."],"forward_implications":["The point statistic $P_{n,\\ell}^{(r)}$ can be read directly from the Riordan array $\\left(S_r(x)^2+\\frac{1}{r-1},\\,x(r-1)S_r(x)^2\\right)$, so row sums, alternating sums, and generating functions of level totals are available without further recurrences.","The specialization $r=2$ recovers statements about large Schröder numbers: for example, the alternating row-sum identity $\\sum_{\\ell=0}^n(-1)^\\ell P_{n,\\ell}^{(2)}=S_n$ and analogous identities for up-steps and peaks.","For peaks, the parameter-weighted identity of Corollary 5.3 with $m=1$ gives the clean linear relation $\\sum_{\\ell=0}^n(-1)^\\ell(\\ell+1)p_{n,\\ell}^{(r)}=r(n+1)$, showing that an alternating moment of the peak distribution is exactly linear in $n$.","The $udu$ statistics satisfy $T_{n,\\ell}^{(r)}=\\binom{n-1}{\\ell}T_{n-\\ell,0}^{(r)}r^{\\ell}$ and the moment identity $\\sum_{\\ell=1}^n\\ell T_{n+1,\\ell}^{(r)}=rnS_n^{(r)}$, linking total $udu$-occurrences to the Schröder-like numbers $S_n^{(r)}$.","The same Riordan-array derivation goes through for weighted $(a,b)$-Dyck paths, giving parameterized analogues (Theorems 7.1-7.3) that specialize to the colored results when $a=r$, $b=r-1$."],"supporting_citations":[{"why":"Supplies the closed forms and functional equations for weighted Schröder numbers $S_n(a,b)$, from which $S_r(x)=S(1,r-1;x)$ and its quadratic are taken.","marker":"[12]"},{"why":"Gives the Lagrange inversion formula used in Theorems 3.1, 4.1, 5.1, and 6.1 to extract the binomial sums.","marker":"[26]"},{"why":"Provides the Dyck path framework and the first-return decomposition that the paper adapts to the last-return decomposition $D=D_1uD_2d_j$.","marker":"[18]"},{"why":"Defines the Riordan group and the $(d(x),h(x))$ notation in which the three main level-statistics results are stated.","marker":"[43]"},{"why":"Is the earlier enumeration of $udu$-steps in plain Dyck paths that Theorem 6.1 extends to the colored no-equal-dd setting.","marker":"[51]"}],"fun_headline_variants":["Riordan arrays pin four statistics on color-restricted Dyck paths","One generating function yields four Dyck-path statistics","Dyck paths with no twin descent colors: four statistics counted","Exactly counting four statistics of color-restricted Dyck paths"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The recurrences in Sections 3-5 all rest on the assertion that in the decomposition $D=D_1uD_2d_j$ of a path in $\\mathcal{A}_{n+1,0}^{(r)}$, the color of the final down-step $d_j$ is independent of everything else: it has $r-1$ choices when $D_2$ is nonempty and $r$ choices when $D_2$ is empty, with no additional restriction coming from the last step of $D_1$ or the first step of $D_2$.","fun_headline_variants_meta":{"raw":{"variants":["Riordan arrays pin four statistics on color-restricted Dyck paths","One generating function yields four Dyck-path statistics","Dyck paths with no twin descent colors: four statistics counted","Exactly counting four statistics of color-restricted Dyck paths"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001924,"raw_usage":{"total_tokens":7656,"prompt_tokens":1192,"completion_tokens":6464,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":808,"completion_tokens_details":{"reasoning_tokens":6396}},"tokens_in":808,"tokens_out":6464,"duration_ms":45759,"temperature":1.0,"reasoning_tokens":6396,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:13:25.431729+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all 3-colored Dyck paths of length 8 (that is, $n=4$) with no two consecutive down-steps of the same color, and count the total number of points at level 2. The formula in Theorem 3.1 evaluates to $P_{4,2}^{(3)}=1128$; if a complete direct enumeration gives any other number, the last-return decomposition used in the proof is not a bijection and the Riordan-array formulas fail.","supporting_citations":[{"cited_title":"Chen and H","cited_arxiv_id":null,"evidence_quote":"Supplies the closed forms and functional equations for weighted Schröder numbers $S_n(a,b)$, from which $S_r(x)=S(1,r-1;x)$ and its quadratic are taken."},{"cited_title":"Gessel,Lagrange inversion, J","cited_arxiv_id":null,"evidence_quote":"Gives the Lagrange inversion formula used in Theorems 3.1, 4.1, 5.1, and 6.1 to extract the binomial sums."},{"cited_title":"Deutsch,Dyck path enumeration, Disc","cited_arxiv_id":null,"evidence_quote":"Provides the Dyck path framework and the first-return decomposition that the paper adapts to the last-return decomposition $D=D_1uD_2d_j$."},{"cited_title":"Shapiro, S","cited_arxiv_id":null,"evidence_quote":"Defines the Riordan group and the $(d(x),h(x))$ notation in which the three main level-statistics results are stated."},{"cited_title":"number of udu’s","cited_arxiv_id":null,"evidence_quote":"Is the earlier enumeration of $udu$-steps in plain Dyck paths that Theorem 6.1 extends to the colored no-equal-dd setting."}],"review_version":1}