REVIEW 1 major objections 6 minor 3 references
Trees that can be grown in "too many" ways: A review of Bouch's construction
T0 review · 1 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash
Pith's one-line read This paper gives a complete proof of Bouch's theorem: on the square lattice, infinitely many trees can be grown from a root in at least L!/C^L distinct orders.
desk verdict A useful, honest review of Bouch's tree construction; the proof is correct, with two small gaps that are easy to fix. 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
Two devices carry the argument. The first is the tree weight $W(T)=\prod_{b\in T} w(b)$, where $w(b)-1$ counts the bonds downstream of $b$ (the 'flow' starts at the root); Lemma 2.1, attributed to Elizabeth Kupin, states that $N(T)=L!/W(T)$, turning the combinatorial growth count into a product estimate. The second is the hierarchical construction: $T_j$ consists of a horizontal segment of $\ell_j$ bonds and $b_j$ rotated copies of $T_{j-1}$, with $\ell_1=E_1$, $b_j=E_j/E_{j-1}$, $\ell_j=4E_jE_{j-2}/E_{j-1}$, and $E_j=(a_j)^2$ where $a_j=2a_{j-1}$ (an iterated exponential, e.g. $a_2=2^{2^{20}}$ with the paper's $a_0=20$). The enormous growth of the $E_j$ makes the ratio $E_{k-2}/E_{k-1}$ so small that the series $\sum_{k\ge2}4(E_{k-2}/E_{k-1})\log L_k$ converges; this yields $\log W_j\le C_2L_j$ and hence $W_j\le C^{L_j}$. The spacing condition $\ell_j/b_j>\ell_{j-2}$ is asserted to keep the rotated branches from overlapping.
What would settle it
Take the paper's explicit parameters (for instance $a_0=1$ or $a_0=20$), write down the coordinates of every bond of $T_3$ or $T_4$, and check directly whether any two rotated copies of $T_{j-1}$ on the horizontal segment overlap. An overlap would mean the object is not a tree, so the weight recursion (2.12) would fail at that generation; verifying the absence of overlap for the first several generations would confirm the geometric condition in practice.
Extended reading notes
Core claim
The central claim is Bouch's theorem (Theorem 1.1): there exists a constant $C>1$ and an infinite set $\mathcal{G}$ of positive integers such that, for every $L\in\mathcal{G}$, there is a rooted tree on the square lattice $\mathbb{Z}^2$ with exactly $L$ bonds whose growth-order count $N(T)$ satisfies $N(T)\ge L!/C^L$. The proof constructs a sequence of trees $T_1,T_2,\dots$ hierarchically: $T_j$ is a horizontal segment of $\ell_j$ bonds carrying $b_j$ rotated copies of $T_{j-1}$ as side branches. Using Kupin's lemma $N(T)=L!/W(T)$, where $W(T)$ is the product of downstream-bond count weights, the desired lower bound on $N(T_j)$ is equivalent to an upper bound $W(T_j)\le C^{L_j}$. The paper proves this bound by choosing the branch parameters to grow so fast (a double exponential) that the per-bond logarithmic weight sums to a finite constant.
Load-bearing premise
The whole proof assumes that the side branches (which are rotated copies of the previous tree) attached along the horizontal segment never overlap each other or the segment; the paper asserts a spacing inequality guarantees this but does not prove it for all generations.
Editorial extensions
If this is right
- For every $L$ in the infinite set $\mathcal{G}$, the construction produces an explicit rooted tree on $\mathbb{Z}^2$ with $N(T)\ge L!/C^L$, giving a constructive counterpart to the non-constructive Bethe-lattice argument reported in the paper.
- The weight bound $W(T_j)\le C^{L_j}$ implies that the vast majority of bonds in $T_j$ lie in the youngest-generation side branches, with the bottom horizontal segment containing a vanishing fraction of the bonds as $j$ grows.
- Via the cited works, the existence of such trees enters lower-bound results on operator growth and Lanczos coefficients in quantum spin systems in two or higher dimensions, which is the paper's stated motivation.
- The theorem leaves open whether the same near-saturation holds for every bond count $L$; Bouch's construction covers only an infinite subsequence.
Reading between the lines
- If the spacing condition ever failed, the construction could likely be repaired by lengthening the horizontal segment (increasing $\ell_j/b_j$), since the convergence estimates only need the ratios $E_{j-2}/E_{j-1}$ to be small; the paper does not explore this repair.
- A direct computational check for small $j$ (e.g. $j=2,3,4$) is feasible: with the explicit coordinates fixed, the exact value of $N(T_j)$ can be computed and tested against $N(T_j)\ge L_j!/C^{L_j}$, providing an independent check of both the growth bound and the non-overlap condition.
- The double-exponential parameter choice is likely far from minimal; trying slower growth (such as a fixed-height tower of exponentials) would test whether the same summability, and hence the theorem, survives with a smaller constant or a denser set of valid $L$.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents a detailed exposition of Bouch's construction of rooted trees on the square lattice with growth count N(T) ≥ L!/C^L for infinitely many bond numbers L. The author defines a recursive family T_j, derives a recursion for the product weight W(T_j) = ∏ w(b), bounds log W(T_j) ≤ C L_j using a fast-growing parameter sequence, and then applies the Kupin–Bouch formula N(T)=L!/W(T) to conclude Theorem 1.1. The note is intended as a self-contained review and also discusses the implication for quantum operator growth.
Significance. If the geometric gap identified below is closed, the paper will be a valuable pedagogical contribution: it makes Bouch's construction accessible, gives explicit and checkable estimates, and clearly separates the algebraic weight recursion from the geometric packing. The derivation of the bound W_j ≤ C^{L_j} is transparent, the final constant is explicit, and the paper is honest about borrowing Lemma 2.1. It should be useful to researchers in quantum many-body physics and combinatorics.
major comments (1)
- [§2.2, Eq. (2.6)] The paper asserts that the condition ℓ_j/b_j > ℓ_{j−2} ensures that the b_j rotated copies of T_{j−1} do not overlap, but no proof is given and the relevant notion of "width" is never defined. For the weight recursion (2.12) to be valid, T_j must be an actual tree, which requires that each rotated copy of T_{j−1} intersect the horizontal segment only at its attachment site and that distinct copies be disjoint. One needs an explicit geometric induction: if h_k denotes the height of T_k (maximal extent perpendicular to its spine), then h_k = ℓ_{k−1} for the chosen orientation, so the width of a rotated T_{j−1} along the horizontal segment is at most ℓ_{j−2}; then (2.6) gives the needed separation. The paper should also state the orientation convention (e.g., all branches on one side of the segment, no sub-branches crossing the segment). This gap is load-bearing because the bound (2.12) is the basis for the final estimate (2.32).
minor comments (6)
- [§2.4] The sentence "The condition (2.6) is automatically satisfied" is correct, since ℓ_j/b_j = 4E_{j−2} > ℓ_{j−2} = 4E_{j−2}E_{j−4}/E_{j−3}, but the computation should be displayed because the inequality is not immediately apparent from (2.13) and (2.14).
- [Lemma 2.1] Since the paper claims to give a complete presentation, include the short induction proof of N(T)=L!/W(T), or state more prominently that this is quoted from Bouch's Lemma 6.2 with a proof reference.
- [§2.4 heading] The heading "Descritpion" is a typo; it should be "Description".
- [Figure 4 caption] The caption says "Bauch's sequence"; it should say "Bouch's sequence".
- [Just before Eq. (2.28)] The phrase "form (2.21) and (2.22)" should be "from (2.21) and (2.22)".
- [Footnote 1] The claim N(T)=(L−1)!!∼√L! is not tied to a specific tree; please clarify which tree this refers to, or remove the sentence if it is not needed.
Circularity Check
No significant circularity: the note is a self-contained review deriving Bouch's theorem from an explicit construction and the weight recursion, with no fitted parameters or self-citation used as evidence.
full rationale
The derivation chain is: define rooted trees T_j recursively from explicit sequences (2.13)-(2.14); record bond counts L_j in (2.10)/(2.17); prove (or cite as a lemma, Lemma 2.1) N(T)=L!/W(T); derive the recursion W_j <= (W_{j-1})^{b_j} L_j^{ell_j} in (2.12), translate it into (2.18)-(2.20); and bound the resulting sums using the rapidly increasing sequence a_j, obtaining W_j <= C^{L_j}. The only borrowed ingredient is Lemma 2.1, which is stated as a standard induction result and referenced to Bouch's Lemma 6.2; that lemma is not the theorem being proved, and the paper gives the formula and a proof sketch ('It can be proved easily by induction'). No parameter is fitted to any target quantity, and no 'prediction' is read back from data. The self-citations to [2] and [3] appear only in the abstract and introductory motivation about operator growth; they are not used to justify Theorem 1.1. The skeptical concern about condition (2.6), namely that the paper asserts without proof that the spacing condition prevents all overlaps of rotated copies, is a potential gap in the existence of T_j, not a circularity: it does not make the conclusion equal to an input. If (2.6) were insufficient, the constructed object might fail to be a tree and the recursion would lack a basis, but that would be an incorrectness or incompleteness, not a self-referential derivation. Therefore the circularity score is 0.
Assumptions & free parameters
free parameters (1)
- a0 (seed for the fast-growing sequence) =
20 (Bouch's choice; any positive integer works)
assumptions (2)
- domain assumption Lemma 2.1: For any rooted tree T with L bonds, N(T) = L!/W(T).
- domain assumption The spacing condition (2.6), ℓ_j/b_j > ℓ_{j-2}, is sufficient to embed all rotated copies of T_{j-1} into the square lattice without overlaps.
Cite this review
Pith. "Pith review of Trees that can be grown in "too many" ways: A review of Bouch's construction." pith.science (2026). https://pith.science/paper/MYXWZDRY
@misc{pith2026241216912,
author = {Pith},
title = {Pith review of: Trees that can be grown in "too many" ways: A review of Bouch's construction},
year = {2026},
howpublished = {\url{https://pith.science/paper/MYXWZDRY}},
note = {Machine review of arXiv:2412.16912}
}
abstract
We carefully review the hierarchical construction by Bouch [Bouch2015] of trees on the square lattice that can be grown from its root in $L!/C^L$ distinct ways, where $L$ denotes the number of bonds constituting the tree, and $C>1$ is a constant. (As discussed in Section IV.A of [ParkerCaoAvdoshkinScaffidiAltman2019] and Appendix A.3 of [ShiraishiTasaki2024], this result has an implication on the operator growth in quantum spin systems in two or higher dimensions.)
Figures
Figures from the paper (2 more)
Reference graph
Works this paper leans on
-
[1]
Bouch, Complex-Time Singularity and Locality Estimates for Quantum Lattice Sys- tems, J
G. Bouch, Complex-Time Singularity and Locality Estimates for Quantum Lattice Sys- tems, J. Math. Phys. 56, 123303 (2015). https://arxiv.org/abs/1011.1875
arXiv 2015
-
[2]
D.E. Parker, X. Cao, A. Avdoshkin, T. Scaffidi, and E. Altma n, A Universal Operator Growth Hypothesis , Phys. Rev. X 9, 041017 (2019). https://journals.aps.org/prx/abstract/10.1103/PhysRevX.9.041017
-
[3]
N. Shiraishi and H. Tasaki, The S = 1 2 XY and XYZ models on the two or higher dimen- sional hypercubic lattice do not possess nontrivial local c onserved quantities , (preprint, 2024), https://arxiv.org/abs/2412.18504 8
arXiv 2024
Reviewed August 11, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.