REVIEW 3 major objections 4 minor 7 references
Ordered trees and the Geode
T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read The Geode power series $G$ counts ordered trees with a marked leaf that appears before every non-leaf node in post-order traversal.
desk verdict A genuinely new tree interpretation of the Geode coefficients with a small but load-bearing error in Definition 5 that makes Theorem 1 false as printed; the fix is one line and the underlying result is likely correct. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the recursive bijection of Theorem 2 between subdigons (polygonal dissections with a distinguished roof edge) and ordered trees: faces become internal nodes, internal edges become children, and the root corresponds to the roof. Under this map, a face with a single internal edge (an external face) becomes a node all of whose children are leaves. Lemma 1 shows that deleting the first external face encountered counterclockwise from the roof, and marking its unique internal edge, gives a reversible operation on marked subdigons. The proof of Theorem 1 then identifies, through the bijection, leaves visited before any non-leaf in post-order with external edges lying before or inside that first external face.
What would settle it
For $\mathbf m=(0,1,0,\ldots)$, one node with two children, Theorem 1 predicts $L_{\mathbf m}=2$: the two leaves of the unique binary tree are both visited before the root in post-order. If the coefficient of $t_2$ in $G$ computed from $S=1+\sum_{n\ge 1} t_n S^n$ and the factorization is anything other than 2, the theorem is false.
Extended reading notes
Core claim
On the paper's own terms, the central claim is Theorem 1: for every sequence $\mathbf m=(m_1,m_2,\ldots)$ of nonnegative integers with finite sum, let $L_{\mathbf m}$ be the number of pairs $(T,v)$ where $T$ is an ordered tree with exactly $m_n$ nodes having $n$ children, $v$ is a leaf, and $v$ is visited before any non-leaf node in post-order traversal. Then the Geode power series satisfies $G=\sum_{\mathbf m} L_{\mathbf m} t^{\mathbf m}$. Equivalently, deleting the first-external-face data in a subdigon and translating through the subdigon–tree bijection gives the same count, so the marked early leaf is the tree-side shadow of an external edge lying before or inside the first external face.
Load-bearing premise
The result rests on the order-preservation claim that the subdigon-to-tree bijection sends external edges encountered counterclockwise from the roof exactly to the leaves visited before the first non-leaf in post-order, and sends the first external face to that first non-leaf.
Editorial extensions
If this is right
- The coefficient of $t^{\mathbf m}$ in $G$ can be read off directly from ordered trees: count leaves that appear before the first internal node in post-order, with the degree sequence fixed.
- The factorization $S=1+(t_1+t_2+\cdots)G$ now has a tree-level explanation: removing the leftmost node whose children are all leaves sends a tree of type $\mathbf m$ to a marked tree of type $\mathbf m-\mathbf e_n$.
- The earlier disproved conjecture is corrected exactly: the extra leaf is not arbitrary but must be visited before any non-leaf node.
- The same counting object appears on the subdigon side as external edges before the first external face, giving a second geometric model for $G$.
Reading between the lines
- A direct algorithmic consequence the author does not spell out: $L_{\mathbf m}$ can be computed by a single depth-first scan of each ordered tree, so the theorem yields an $O(\text{size of tree})$ check for every coefficient.
- The external-face/early-leaf dictionary suggests a likely explicit bijection between the lattice paths counted by Gessel and these marked ordered trees; if constructed, it would give a purely visual proof that the two interpretations agree.
- Because the first external face is unique, the marked-edge recursion in Lemma 1 could be iterated to produce a pruning sequence for ordered trees, giving a new recurrence for $G$'s coefficients that does not mention subdigons at all.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the hyper-Catalan series S = sum C_m t^m, defined by S = 1 + sum_{n>=1} t_n S^n, and its factorization S = 1 + (t1+t2+...)G, where G is the Geode. The main result, Theorem 1, proposes a combinatorial interpretation of the coefficients of G: L_m counts pairs (T,v) where T is an ordered tree with m_n nodes of outdegree n for each n, v is a leaf of T, and v is visited before any non-leaf node in post-order traversal. The proof introduces a subdigon analogue based on marked external edges (Lemma 1) and asserts a correspondence between marked subdigons and marked ordered trees.
Significance. If Theorem 1 is correct, it gives a clean ordered-tree interpretation of the Geode, repairing a disproved conjecture of Wildberger and Rubine. The intended combinatorial interpretation is plausible and matches small-degree examples; the paper is written accessibly and uses standard tools. However, the submitted version contains a defective definition of post-order and a serious flaw in the proof of Lemma 1. The central claim is therefore not established as written, although a repair along the tree-decomposition route sketched in Section 3 appears feasible. This is a candidate for major revision rather than rejection.
major comments (3)
- [Definition 5 / Theorem 1] Definition 5's recursive rule for post-order never visits a node that has children: the else branch only runs the procedure on each child. Read literally, non-leaf nodes are not in the traversal, so the condition 'v is visited before any non-leaf node' in Theorem 1 is vacuous for every leaf. For m=(2,1) the six ordered trees have two leaves each, so L_m=12, while the Geode coefficient of t1^2 t2 is 9 (C_{4,0}=1 gives g_{3,0}=1, and C_{3,1}=10 gives g_{2,1}=10-1=9). The standard post-order should read 'run the procedure on each child in order, then visit the node itself'; with that fix the examples match.
- [Lemma 1 and proof of Theorem 1] The proof of Lemma 1 claims to prove S = 1 + (t1+t2+...)S by a bijection S_m -> union_{n: m_n>=1} {n} x S_{m-e_n}. This recurrence is not the defining equation of G; if it held, the marked-edge series would be 1/(1-(t1+t2+...)). Concretely, for m=(1,1) the recurrence gives |S_{1,1}|=|S_{0,1}|+|S_{1,0}|=2, but the coefficient of t1 t2 in G is 5 (from C_{3,0}=1, so g_{2,0}=1, and C_{2,1}=6, so g_{1,1}+g_{2,0}=6). The map deleting the first external face and marking its internal edge need not land in S_{m-e_n}: the marked edge may no longer lie before or inside the new first external face, and the inverse attaching operation may create a face that is not first. This is load-bearing because Theorem 1 is derived by combining |S_m|=|T_m| with Lemma 1. The tree-side decomposition in the paragraph before Lemma 1 (remove the leaves of the leftmost clawed node and mark that node) is the correct route and should be used to prove G = sum |T_m| t^m directly.
- [Proof of Theorem 1] The proof asserts without argument that the post-order leaf order matches, edge by edge, the counterclockwise order of external edges along the central face, and that the first non-leaf in post-order is the clawed node corresponding to the first external face. This is a nontrivial order-preservation statement and is exactly what makes |S_m|=|T_m|. It should be proved by induction on the recursive structure of the subdigon-to-tree bijection, rather than asserted. If this correspondence fails, the equality |S_m|=|T_m| would break.
minor comments (4)
- [Introduction] The factorization is printed as S = 1 + (t2 + t3 + ...)G in the introduction but as S = 1 + (t1 + t2 + ...)G in the abstract and Section 3; please reconcile, and if the m1=0 convention of [7] is being used, say so explicitly.
- [Section 2 and Lemma 1] The letter S is used both for the hyper-Catalan series in Section 2 and for the marked-edge series in Lemma 1; this collision makes the line 'We prove that S = 1 + (t1+t2+...)S' especially confusing. Give the marked-edge series a different name.
- [Section 3, before Definition 5] The marked-tree sets denoted T_m (or T_m with an overline) are used in the decomposition paragraph before they are defined; Definition 5 introduces them only afterwards. Define these sets before using them.
- [Section 1] The sentence 'For the following ordered trees T , the nodes v which satisfy the above conditions have been circled' refers to a figure that does not appear in the submitted text; either include the figure or remove the sentence.
Circularity Check
No significant circularity: the Geode coefficients are obtained from an independent combinatorial construction, not from an assumed target identity.
full rationale
The paper's central identity G = sum_m L_m t^m is not circular. G is introduced as the unique series in the factorization S = 1 + (t1+t2+...)G, while L_m is an independently defined count of marked leaves in ordered trees with prescribed downdegree sequence. The proof establishes the equality by first giving a subdigon model whose marked generating function is shown, via an explicit bijection, to satisfy the same factorization equation, and then transferring this bijection to ordered trees using the subdigon-to-tree correspondence of Theorem 2. None of these steps fits the marked objects' generating function to the target coefficients, defines the objects in terms of G, or relies on a self-citation chain; the cited factorization and uniqueness facts come from external work. Even if the literal wording of Definition 5 or the step deleting the first external face raises correctness concerns, those are not reductions of a prediction to its own input. The derivation is therefore self-contained for circularity purposes.
Assumptions & free parameters
assumptions (3)
- domain assumption The formal power series S satisfies S = 1 + sum_{n>=1} t_n S^n and admits a factorization S = 1 + (t1 + t2 + ...)G with G a formal power series.
- standard math The intended post-order traversal visits a node after all its children, even though Definition 5's recursive bullet omits that step.
- ad hoc to paper The subdigon-to-tree bijection maps external faces to clawed nodes and external edges to leaves in the claimed counterclockwise and post-order order.
Cite this review
Pith. "Pith review of Ordered trees and the Geode." pith.science (2026). https://pith.science/paper/WYP4WCJE
@misc{pith2026250718097,
author = {Pith},
title = {Pith review of: Ordered trees and the Geode},
year = {2026},
howpublished = {\url{https://pith.science/paper/WYP4WCJE}},
note = {Machine review of arXiv:2507.18097}
}
abstract
In recent work of Wildberger and Rubine, it is shown that the formal power series $\mathbf{S}$ in the variables $t_1,t_2,\dots$ satisfying $\mathbf{S}=1+\sum_{n\geq 1} t_n\mathbf{S}^n$ has a factorisation $\mathbf{S}=1+(t_1+t_2+\cdots)\mathbf{G}$, where $\mathbf{G}$ is a power series with nonnegative coefficients called the Geode. In this note we give a combinatorial interpretation for the coefficients of $\mathbf{G}$ based on ordered trees. This amends the statement of a disproved conjecture of Wildberger and Rubine which suggests a similar (but incorrect) interpretation.
Reference graph
Works this paper leans on
-
[1]
Proofs Of Three Geode Conjectures
Tewodros Amdeberhan and Doron Zeilberger. Proofs of three Geode conjectures, 2025. arXiv:2506.17862
work page Pith review arXiv 2025
-
[2]
Some problems of non-associative combinations (I)
IMH Etherington. Some problems of non-associative combinations (I). Edinburgh Mathematical Notes, 32:i–vi, 1940
work page 1940
-
[3]
Ira M. Gessel. Lattice paths and the Geode, 2025. arXiv:2507.09405
work page Pith review arXiv 2025
-
[4]
Exercises for A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode
Dean Rubine. Exercises for a hyper-Catalan series solution to polynomial equations, and the Geode, 2025. arXiv:2507.13045
work page Pith review arXiv 2025
-
[5]
Hyper-Catalan and Geode Recurrences and Three Conjectures of Wildberger
Dean Rubine. Hyper-catalan and Geode recurrences and three conjectures of Wild- berger, 2025. arXiv:2507.04552
work page Pith review arXiv 2025
-
[6]
Polygonal dissections and reversions of series
Alison Schuetz and Gwyn Whieldon. Polygonal dissections and reversions of series. Involve, a Journal of Mathematics, 9(2):223–236, 2016
work page 2016
-
[7]
A hyper-Catalan series solution to polynomial equa- tions, and the Geode
NJ Wildberger and Dean Rubine. A hyper-Catalan series solution to polynomial equa- tions, and the Geode. The American Mathematical Monthly, 132(5):383–402, 2025
work page 2025
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.