Pith. sign in

REVIEW 1 major objections 5 minor 1 cited by

Lattice paths and the Geode

T0 review · 1 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves exact reciprocal formulas for the Geode series and shows that the Geode, its companion series, and the base series count nonnegative paths, positive paths, and excursions respectively.

desk verdict Correct and useful closed forms for the Geode with a repairable hole in one subargument; recommend acceptance. read the letter →

arxiv 2507.09405 v2 pith:TUQLURYF submitted 2025-07-12 math.CO

Ira M. Gessel This is my paper · ORCID
classification math.CO MSC 05A1505A19
keywords GeodeformalpowerserieslatticepathsgeneratingfunctionsexcursionsfreemonoidsCatalannumbersSchröder
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper pins down the Geode, a formal power series $G$ defined through $S=1+G S_1$, where $S=1+\sum_{n\ge1} t_n S^n$ and $S_1=\sum_{n\ge1} t_n$. The main result gives $G$ and the companion series $H=G/S$ as explicit reciprocals of finite geometric sums in $S$, and then reads those algebraic formulas as counting formulas. With the step set $\{-1,0,1,2,\dots\}$, up step $n\ge0$ weighted $t_{n+1}$ and down step $-1$ weighted $1$, $S$ counts excursions, $G$ counts nonnegative paths, and $H$ counts positive paths. The identities turn the Geode from an implicitly defined series into the generating function for a concrete family of lattice paths, and a short corollary evaluates it in closed form on parameter vectors whose entries sum to zero.

What carries the argument

The central mechanism is a unique path factorization: with the step set consisting of $-1,0,1,2,\dots$ and $-1$ as the sole down step, any reverse-nonnegative path ending at height $-n$ factors uniquely as $E_1 D E_2 D \cdots D E_{n+1}$, where each $E_i$ is an excursion and $D$ is the step $-1$. This lemma turns reverse-positive paths into products of excursions and a down step, so the generating function of arches becomes $\sum_{n=0}^\infty t_{n+1} S^n$. The paper couples this with a standard freeness criterion for submonoids of a free monoid, which lets it identify prime nonnegative paths, with generating function $\sum_{n\ge0} t_{n+1}(1+S+\cdots+S^n)$, and prime positive paths, with generating function $\sum_{n\ge1} t_{n+1}(S+\cdots+S^n)$, yielding the reciprocal formulas for $G$ and $H$.

What would settle it

Specialize to $t_1=0$, $t_2=x$, and $t_n=0$ for $n\ge3$, so $S$ is the Catalan series. The closed form gives $G=(1-x(1+S))^{-1}$; expanding this, the coefficient of $x^3$ is $14$. Enumerating directly the nonnegative paths with steps $+1$ (weight $x$) and $-1$ (weight $1$) that use exactly three up steps also gives $14$, so any mismatch between these two computations would refute the claimed path interpretation.

Watch

Extended reading notes

Core claim

The paper establishes that the Geode has the closed form $G=\bigl(1-\sum_{n=1}^\infty t_n(1+S+S^2+\cdots+S^{n-1})\bigr)^{-1}$, while $H=G/S$ satisfies $H=\bigl(1-\sum_{n=2}^\infty t_n(S+S^2+\cdots+S^{n-1})\bigr)^{-1}$ and $S=1/(1-H S_1)$. It then proves the combinatorial core: $S$ is the generating function for excursions, namely nonnegative paths that return to height $0$; $G$ is the generating function for all nonnegative paths; and $H$ is the generating function for positive paths. The proof of the $G$ identity uses a last-up-step decomposition of excursions, while the companion formulas are derived from free-monoid factorizations of prime nonnegative and positive paths. A corollary gives $G(u_1,\dots,u_m)=(1-\sum_{n=1}^m n u_n)^{-1}$ whenever $\sum_{n=1}^m u_n=0$, which proves the conjectured evaluation $G(0,-f,f,\dots,-f,f)=(1-kf)^{-1}$.

Load-bearing premise

The path model requires that $-1$ is the only negative step, making the first descent from height $0$ land exactly at $-1$; the unique $E_1 D E_2 D\cdots$ factorizations used throughout depend on this and would fail if other negative steps were allowed.

Editorial extensions

If this is right

  • The nonnegativity of the coefficients of $G$ and $H$ is immediate from the reciprocal forms, since each factor expands as a geometric series in sums of monomials with nonnegative coefficients.
  • Each identity in Theorem 2.1 acquires a bijective meaning: equation (2) counts arches, equation (3) counts arches via one up step inserted into a positive path, and equations (4) and (5) count prime nonnegative and positive paths.
  • At any parameter vector with $\sum u_n=0$, $G$ and $H$ coincide and equal $(1-\sum n u_n)^{-1}$, which settles the conjectured alternating-sign evaluation $G(0,-f,f,\dots,-f,f)=(1-kf)^{-1}$.
  • Setting $t_n=0$ for $n>2$ gives explicit radical formulas whose coefficients are the Catalan, Motzkin, Riordan, and large and small Schr\"oder numbers.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because $G$ is a generating function for nonnegative lattice paths, standard enumeration techniques for such paths can now be applied to the Geode; the appendix already uses one such factorization to give a second proof of the path interpretation.
  • The zero-sum specialization suggests a rigidity principle: at a zero-sum parameter vector only the linear statistic $\sum n u_n$ survives in $G$; whether similar reductions hold for other specializations is not explored in the paper.
  • Replacing the single down step $-1$ by several negative step sizes would require more elaborate factorizations and could produce multivariate Geode-type series, a direction the paper does not pursue.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The paper studies the formal power series S defined by S = 1 + Σ_{n≥1} t_n S^n and the associated series G (the Geode) and H = G/S, which satisfy S = 1 + GS_1 and S = 1/(1 - HS_1). It proves closed forms G = (1 - Σ_{n≥1} t_n(1 + S + ... + S^{n-1}))^{-1} and H = (1 - Σ_{n≥2} t_n(S + ... + S^{n-1}))^{-1}, and gives lattice-path interpretations: S counts excursions, G counts nonnegative paths, and H counts positive paths, with step set {-1,0,1,2,...} and weights t_{n+1} for the up step n and weight 1 for the down step -1. It also works out the Catalan, Motzkin, Riordan, and Schröder specializations, and gives an appendix proof of the lattice-path interpretation of G via Wiener-Hopf factorization.

Significance. The algebraic derivation of Theorem 2.1 is clean, direct, and parameter-free, and Corollary 2.2 gives a short proof of a conjecture of Wildberger and Rubine. The lattice-path bijections in Theorems 3.3-3.5 are standard and, apart from one localized gap discussed below, correct; they connect the Geode to classical combinatorial objects and give a concrete combinatorial model. The paper also makes explicit connections to Catalan, Motzkin, Riordan, and Schröder numbers. The central claims are sound and the presentation is generally clear. The main weakness is a flawed justification in the free-monoid decomposition of Section 3.3, which is local and does not affect the main theorems.

major comments (1)
  1. [Section 3.3] In the paragraph after Lemma 3.6, the assertion 'Then P ends at height less than or equal to n since if not, the factors Un and Q would both be nonnegative and nonempty' is false as stated. For example, the nonnegative path P = (4,-1,-1,-1,5) starts with the up step n = 4 and ends at height 5 > 4, but the remaining path Q = (-1,-1,-1,5) is not nonnegative. The conclusion j ≤ n for a prime nonnegative path is nevertheless correct, but it requires a different argument: in a prime nonnegative path the endpoint must be the unique minimum after the first step, so Q is reverse-positive; if j > n then Q would be a nonempty nonnegative path, giving the factorization U_n Q. Please replace the faulty sentence with this argument or an equivalent one, and similarly justify the following claim that no intermediate point has height at most j.
minor comments (5)
  1. [Section 4] In the first sentence, 'generating functins' should be 'generating functions'.
  2. [Section 2] The parenthetical 'we have including the variable t1' is grammatically awkward; consider rewording to 'we have included the variable t1'.
  3. [Section 3.3] The displayed formula for the generating function of prime nonnegative paths ends with '1 + S + S2 + Sn'; this should be '1 + S + S^2 + ... + S^n'.
  4. [Section 5] The phrase 'In Section 5 we gave an indirect alternative proof' should be 'In Section 5 we give an indirect alternative proof', since the section is part of the present paper.
  5. [Lemma 3.1] The uniqueness part of the factorization is left to the reader; while routine, a brief indication would improve readability and avoid ambiguity in later uses of the lemma.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Geode formulas and lattice-path interpretations are derived directly from the defining equation for S.

full rationale

The paper's central identities, Theorem 2.1 equations (2)-(5), are algebraic consequences of the defining equation S = 1 + sum_{n>=1} t_n S^n, with G defined as (S-1)/S1 and H = G/S. Equation (4) follows by writing S-1 = sum t_n(S^n-1) and using S-1 = G S1, and (5) follows from H^{-1}-G^{-1}=S1. No fitted parameters are introduced, and no quantity called a prediction is obtained from data of the same kind. The combinatorial interpretations in Theorems 3.3-3.5 are established by explicit bijections against independently defined path classes: excursions are counted by the unique solution of the same fixed-point equation, nonnegative paths are bijected with nonempty excursions by deleting the last up step and following down steps (with inverse construction), and positive paths give the unique factorization G = S H. The free-monoid interpretations in Section 3.3 instantiate the standard generating-function identity U = 1/(1-V) and do not presuppose the formulas being proved. Self-citations (e.g., [5,6,7]) are used only for standard factorization techniques or a published proof of Schutzenberger's criterion, and the argument does not depend on any unverified claim by the author. A minor flaw appears in the proof of the prime-nonnegative-path decomposition in Section 3.3, where the assertion that a prime path starting with U_n cannot end above n because then U_n and Q would both be nonnegative is not generally valid; the stated conclusion can be justified differently and does not make the derivation circular. Overall, the derivation chain is self-contained against the defining equation and independent path-class definitions.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claims rest on standard formal-power-series facts and on the explicit restriction of the path step set. The step-set restriction is the only domain-specific assumption; without it the factorization lemmas that drive the combinatorial interpretations fail. No free parameters are fitted, and no new ad hoc entities are introduced.

assumptions (4)
  • standard math The defining equation S = 1 + sum_{n>=1} t_n S^n has a unique formal power series solution.
    Relied on in Theorem 3.3 to identify S with the excursion generating function; standard result in the ring of formal power series.
  • domain assumption Steps are restricted to {-1,0,1,2,...}, with the only negative step being -1.
    Stated in Section 3.1; Lemma 3.1, and therefore Theorems 3.3-3.5, depend on the existence of a first down step from height 0 to -1 and on the absence of steps below -1.
  • standard math Schutzenberger's criterion (Lemma 3.6) is valid for submonoids of a free monoid.
    Invoked in Section 3.3 to show nonnegative and positive paths are free monoids; cited from Schutzenberger [12] and Gessel-Li [7].
  • standard math The Wiener-Hopf factorization of a path at its first and last lowest points is valid.
    Used in Section 5 to derive identity (12) from the factorization of arbitrary paths into reverse-positive followed by nonnegative paths.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Lattice paths and the Geode." pith.science (2026). https://pith.science/paper/TUQLURYF

@misc{pith2026250709405,
  author       = {Pith},
  title        = {Pith review of: Lattice paths and the Geode},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TUQLURYF}},
  note         = {Machine review of arXiv:2507.09405}
}
abstract

Let $t_1,t_2,\dots$ be variables, and let $S$ be the formal power series in the variables $t_1, t_2,\dots$ satisfying $S=1+\sum_{i=1}^\infty t_n S^n.$ Let $S_1 =\sum_{n=1}^\infty t_n$. Wildberger and Rubine recently showed that there is a formal power series $G$ in the $t_i$, which they called the Geode, satisfying $S=1+GS_1$. In this paper we discuss some of the properties of the Geode and of the related series $H=G/S$, which satisfies $S=1/(1-HS_1)$. We show that \begin{equation*} G=\biggl(1-\sum_{n=1}^\infty t_n (1+S+S^2+\cdots+S^{n-1})\biggr)^{-1}, \end{equation*} and \begin{equation*} H=\biggl( 1-\sum_{n=2}^\infty t_n (S+S^2+\cdots+S^{n-1})\biggr)^{-1}, \end{equation*} and we give combinatorial interpretations of $G$ and $H$ in terms of lattice paths.

Figures

Figures reproduced from arXiv: 2507.09405 by the authors.

Figure 1
Figure 1. Geometric depiction of the path (1, 1, −3, 2). path. We will often refer to paths geometrically rather than using the formal definition; for example, if we say that a path (s1, . . . , sk) ends on the x-axis, we mean that s1+· · ·+sk = 0. If P = (p1, . . . , pm) and Q = (q1, . . . , qn) are paths, then their product P Q is the path (p1, . . . , pm, q1, . . . , qn). Geometrically, P Q is obtained by translating Q to … view at source ↗
Figure 2
Figure 2. The nonnegative path (1, 1, −2, 1) and its reversal (−1, 2, −1, −1). The height of point (m, n) is n, so the height of the endpoint of the path (s1, . . . , sk) is s1 +· · ·+sk. An excursion is a path (possibly empty) that ends at height 0 and never goes below height 0. (See [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. An excursion. From here on, we assume that all steps are in the set {−1, 0, 1, 2, . . . }. We call nonneg￾ative steps up steps (so 0 is considered an up step) and we call −1 the down step. It will [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: The factorization of Lemma 3.1. We have a variant of Lemma 3.1 that will also be needed later. Lemma 3.2. Let P be a reverse-positive path that ends at height −n. Then P can be factored uniquely as E1DE2D · · · EnD where each Ei is an excursion and D is the down step −…
Figure 5
Figure 5. Figure 5: An excursion obtained from a nonnegative path. Note that the proof of Theorem 3.4 depends critically on down steps having weight 1; there does not seem to be such a simple formula for counting nonnegative paths where we keep track of the endpoint. Theorem 3.5. The seri…
Figure 6
Figure 6. Figure 6: Factorization of a nonnegative path as an excursion followed by a positive path. the set of all paths (with any fixed set of steps), with the operation of concatenation, is a free monoid, in which the primes are the steps. As a more interesting example, the set of excu…
Figure 7
Figure 7. Figure 7: A prime positive path [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: The Wiener-Hopf factorization of a path For our problem, we want to combine the second and third parts into a nonnegative path, so we have a factorization of every path into a reverse-positive path followed by a nonnegative path. The set of all paths is easy to count, …

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ordered trees and the Geode

    math.CO 2025-07 conditional novelty 5.0 of 10

    The coefficients of the Geode power series count leaves that appear before any internal node in the post-order traversal of ordered trees.

Reference graph

Works this paper leans on

14 extracted references · 12 canonical work pages · cited by 1 Pith paper

  1. [1]

    Tewodros Amdeberhan and Doron Zeilberger, Proofs of three Geode conjectures, arXiv:2506.17862 [math.CO]

    arXiv

  2. [2]

    3, 386–428

    Andrei Asinowski, Axel Bacher, Cyril Banderier, and Bernhard Gittenberger, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata , Algorithmica 82 (2020), no. 3, 386–428

    work page 2020

  3. [3]

    Cyril Banderier and Philippe Flajolet, Basic analytic combinatorics of directed lattice paths , Theoret. Comput. Sci. 281 (2002), no. 1-2, 37–80

    work page 2002

  4. [4]

    Leibniz Int

    Cyril Banderier, Marie-Louise Lackner, and Michael Wallner, Latticepathology and symmetric func- tions (extended abstract), 31st International Conference on Probabilistic, Combinatorial and Asymp- totic Methods for the Analysis of Algorithms, LIPIcs. Leibniz Int. Proc. Inform., vol. 159, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2020, Art. No. 2, 16 pp

    work page 2020

  5. [5]

    Ira Gessel, A noncommutative generalization and q-analog of the Lagrange inversion formula , Trans. Amer. Math. Soc. 257 (1980), no. 2, 455–482

    work page 1980

  6. [6]

    Gessel, A factorization for formal Laurent series and lattice path enumeration , J

    Ira M. Gessel, A factorization for formal Laurent series and lattice path enumeration , J. Combin. Theory Ser. A 28 (1980), no. 3, 321–337

    work page 1980

  7. [7]

    Gessel and Ji Li, Compositions and Fibonacci identities , J

    Ira M. Gessel and Ji Li, Compositions and Fibonacci identities , J. Integer Seq. 16 (2013), no. 4, Art. 13.4.5, 16 pp

    work page 2013

  8. [8]

    82 (1990), no

    Jacques Labelle and Yeong Nan Yeh, Generalized Dyck paths, Discrete Math. 82 (1990), no. 1, 1–6

    work page 1990

Show all 14 references
  1. [9]

    Thesis, Brandeis Uni- versity, 2017

    Cristobal Lemus-Vidales, Lattice Path Enumeration and Factorization , Ph.D. Thesis, Brandeis Uni- versity, 2017

    2017

  2. [10]

    Donatella Merlini, D. G. Rogers, Renzo Sprugnoli, and M. Cecilia Verri, Underdiagonal lattice paths with unrestricted steps , Discrete Appl. Math. 91 (1999), no. 1-3, 197–213

    1999

  3. [11]

    Dean Rubine, Hyper-Catalan and Geode recurrences and three conjectures of Wildberger , arXiv:2507.04552 [math.CO]

    arXiv

  4. [12]

    Marcel Paul Sch¨ utzenberger, Une th´ eorie alg´ ebrique du codage, C. R. Acad. Sci. Paris 242 (1956), 862–864

    1956

  5. [13]

    Stanley, Catalan Numbers, Cambridge University Press, New York, 2015

    Richard P. Stanley, Catalan Numbers, Cambridge University Press, New York, 2015

    2015

  6. [14]

    N. J. Wildberger and Dean Rubine, A hyper-Catalan series solution to polynomial equations, and the Geode, Amer. Math. Monthly 132 (2025), no. 5, 383–402. Department of Mathematics, Brandeis University, W altham, MA 02453 Email address : gessel@brandeis.edu

    2025

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.