Pith. sign in

REVIEW 3 minor 21 references

This paper shows that free type-preserving actions on the biregular tree realize every critical exponent from 0 up to the ambient entropy, and that the finitely generated spectrum is a countable dense set stratified by quotient complexity.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-01 07:56 UTC pith:VUWFS4BC

load-bearing objection Solid paper: the new fixed-rank stratification, rank-drop, and rank-two inverse classification are correct and worth serious review, with only a minor endpoint wording issue.

arxiv 2607.21294 v1 pith:VUWFS4BC submitted 2026-07-23 math.GR math.CO

Critical-exponent stratification and inverse realization on biregular trees

Sanghoon Kwon This is my paper
classification math.GR math.CO MSC 20E0805C5020F6905C31
keywords critical exponentbiregular treefree group actionnon-backtracking matrixIhara zeta functionspectral radiusfixed-rank stratificationinverse realization
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper tries to determine exactly which exponential growth rates occur for free, type-preserving, discrete group actions on the biregular tree T_{r+1,s+1}. It proves that the unrestricted spectrum of critical exponents is the whole interval [0, 1/2 log(rs)], so every rate up to the tree's own volume entropy occurs. It then shows that requiring the acting group to be finitely generated collapses this continuum to a countable dense set, encoded by the spectral radii of Hashimoto matrices of finite bipartite cores. At fixed rank, finitely many typed kernels parametrize all values, and any accumulation point of a fixed-rank family must belong to a strictly lower rank. At rank two the classification becomes completely explicit: the only possible cores are figure-eight, theta, and dumbbell graphs, with values determined by three polynomial families, and membership is decidable. A sympathetic reader cares because this gives a complete, stratified picture of a natural growth spectrum for tree lattices and free groups.

Core claim

The central discovery is that the critical-exponent spectrum of free type-preserving actions on T_{r+1,s+1} has a complete complexity hierarchy. Without finite generation, the spectrum is the full continuum [0, 1/2 log(rs)]: the paper constructs quotients realizing every delta by gluing finite blocks with strictly increasing rates along a spine with parity-prescribed corridor lengths. With finite generation, the spectrum becomes countable and dense, exactly the Hashimoto spectral radii of finite typed cores with the two degree bounds. At fixed rank, finitely many typed kernels parametrize all values; accumulation points drop to lower rank. At rank two, only figure-eight, theta, and dumbbell

What carries the argument

The load-bearing mechanism is the covering dictionary: a free type-preserving action on the biregular tree is exactly the deck action of a covering T_{r+1,s+1} to Q, and the critical exponent is the logarithm of the spectral radius of the Hashimoto (non-backtracking) matrix of the quotient core. The paper reduces finite cores to typed kernels by suppressing degree-two chains, and studies the weighted turn matrix M_{K,ell}(x) = T_K diag(x^{-ell(e)}); the pressure equation rho(M_{K,ell}(alpha))=1 uniquely selects the Hashimoto radius alpha of the subdivided graph. Sparse gluing of double-ported typed cores along long corridors, with a transfer-matrix estimate, converts local approximations int

Load-bearing premise

The construction of dense finite approximations assumes that every finite graph has finite covers whose lifted color classes can be made arbitrarily separated in the universal cover; if this separation step failed, the full-interval theorem and the density of the finitely generated spectrum would both collapse.

What would settle it

Find one finite connected bipartite core C with b1(C)=2 and 2<=deg(v)<=r+1 on type-zero vertices and <=s+1 on type-one vertices, whose Hashimoto spectral radius alpha=rho(B_C) is not the unique root >1 of any of the three polynomials x^{a+b}-x^a-x^b-3 (a,b even), x^{a+b+c}-x^a-x^b-x^c-2 (a,b,c same parity), or x^{2c}(x^a-1)(x^b-1)-4 (a,b even); a single such core would refute the rank-two inverse theorem and the effective decision procedure.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Every delta in [0, 1/2 log(rs)] is the critical exponent of some free, type-preserving, discrete action on T_{r+1,s+1}; in particular the upper bound from volume entropy is sharp and fully attained.
  • Finitely generated free actions realize exactly the countable dense set determined by Hashimoto radii of finite typed cores, so between any two rates there are infinitely many finitely generated actions with distinct exponents.
  • For a fixed rank g, only finitely many typed kernels are needed to encode all possible rates, and each rate is realized by only finitely many kernel-length data.
  • Any convergent sequence of distinct fixed-rank rates has its limit at strictly lower rank; in particular the rank-two spectrum has no accumulation point above 1.
  • At rank two, membership is decidable: given a real algebraic integer alpha by minimal polynomial and isolating interval, one can decide in finite exact arithmetic whether alpha is realized.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The explicit rank-two inverse classification suggests that the general unrestricted inverse problem of which weak Perron numbers occur may be approachable through the Hashimoto incidence factorization B_C = J_C(O_C^T O_C - I): the missing structure is exactly the reversal involution and the local origin blocks, and a matrix-level characterization would settle the paper's Problem 5.2.
  • The binary-word spine construction implies that the parity pattern of corridor lengths is an extra invariant of the quotient, not visible in the critical exponent alone; this may help distinguish non-isomorphic quotients with the same growth rate.
  • The rank-drop theorem suggests an iterated derived-set (Cantor-Bendixson) hierarchy for the fixed-rank spectra, with each successive derived set landing in lower ranks; refining rank by available typed 'ports' might give a complete description of closures.
  • A testable extension in the regular case: setting r=s=q recovers the untyped finitely generated spectrum on T_{q+1}, so the three rank-two polynomial families should account for all finitely generated free actions on regular trees with rank-two core.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 3 minor

Summary. The paper studies the critical-exponent spectrum of free type-preserving discrete actions on the biregular tree T_{r+1,s+1}. The main results are: (1) the unrestricted multiplicative spectrum is the full interval [1, sqrt(rs)], realized by explicit sparse quotients with prescribed corridor parities; (2) the finitely generated spectrum equals the set of Hashimoto radii of finite bipartite cores satisfying the two degree bounds, and this set is countable and dense; (3) at fixed rank g, finitely many typed kernels parametrize all values, each value has only finitely many kernel–length realizations, and nontrivial accumulation points lie in lower-rank strata; (4) at rank two, there is a complete effective inverse classification in terms of the figure-eight, theta, and dumbbell polynomial families. The proofs are self-contained and largely constructive, with the covering dictionary, Hashimoto matrices, weighted turn matrices, a separated-subdivision density lemma, and a sparse-gluing transfer estimate as the main tools.

Significance. If the results stand, this is a substantial contribution to the spectral theory of tree actions and to inverse Ihara-type realization: it gives the full critical-exponent interval for free type-preserving actions, a countable dense finite-state spectrum, a clean fixed-rank stratification, and an explicit decidable rank-two inverse test. The paper is careful to re-derive the needed density and transfer arguments rather than invoking recent theorems as black boxes. The rank-drop theorem and the finite-kernel parametrization are particularly clean applications of Dickson's lemma and Perron–Frobenius theory. I found no load-bearing error in the central derivation; the issues below are local and presentational.

minor comments (3)
  1. [§3.1, Eq. (19) and following paragraph] The assertion that the open intervals (h0/(3M), h0/M) cover (0, h0] is not literally correct: for example h0/3 is not covered. The subsequent 'choose such an M' for arbitrary t in (0, h0] is therefore not justified as written. This is easily patched by using closed intervals or by treating the endpoint cases directly (the initial or final completed stage realizes them), but the text should be corrected.
  2. [§3.1, Lemma 3.3 proof] The first subdivision step of an edge in a bipartite graph inserts one vertex into an edge whose endpoints have opposite types; the resulting intermediate graph is not bipartite with the original type labeling. The proof should state explicitly that Lemma 3.1 is applied to the universal cover as an uncolored tree, and that bipartiteness and the typed degree structure are restored only after the second subdivision of the active edge. The current wording, 'the graph is again bipartite with the original types,' may suggest bipartiteness persists at every intermediate stage.
  3. [§3.2, Lemma 3.2 proof] The sentence 'one intersects finite-index normal subgroups avoiding one representative from each' is slightly garbled: it should say that one takes the intersection of finitely many finite-index normal subgroups, each excluding one of the finitely many excluded conjugacy classes. This is a wording issue only.

Circularity Check

0 steps flagged

No significant circularity: derivation chain is self-contained

full rationale

The paper's central claims do not reduce to their inputs or to load-bearing self-citations. Theorem 1.1(i) is built from Lemma 3.3 (typed double-ported density) and Theorem 3.4 (sparse binary-coded gluing). Lemma 3.3 uses Lemma 3.1 (separated subdivision estimate) and Lemma 3.2 (finite covers with separated lifted color classes), both proved in the paper, with residual finiteness as a standard external fact. The finite-state spectrum in Theorem 1.1(ii)-(iii) is not a renamed definition: it is a covering-space/Hashimoto characterization proved via Lemmas 2.4 and 2.5, plus the density construction. The fixed-rank and rank-two results are derived from the kernel pressure equation (Theorems 2.6, 4.1, 4.9), not imported from the cited zeta-function computations. The paper explicitly disclaims black-box reliance on external spectral results: "none of these recent theorems is invoked as a black box" and, of the Coulon--Louvaris--Wise--Yehuda interval theorem, "That theorem is not used below." The self-citations [12,13] are background and are not load-bearing. No fitted parameter is later called a prediction, and no uniqueness theorem is imported from the authors' prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 6 axioms · 0 invented entities

No fitted parameters or ad hoc assumptions. The paper proves its main lemmas and invokes standard results (Perron-Frobenius, residual finiteness, Ihara-Bass, Lindemann-Weierstrass, Dickson) as background; these are clearly identified and not used to define the target results.

axioms (6)
  • standard math Perron–Frobenius theory for irreducible nonnegative matrices
    Used throughout (Prop 2.5, Lemma 2.6, Propositions 3.8, 4.1, Theorem 4.9) to control spectral radii and Perron vectors of Hashimoto and weighted turn matrices.
  • standard math Residual finiteness of finitely generated free groups
    Lemma 3.2 uses it to construct finite covers with large girth and separated color classes; this underlies the density lemma.
  • standard math Ihara–Bass determinant formula
    Used in Section 3.4 (Eqs. 31–33) for arithmetic restrictions; cited to [10,3,11].
  • standard math Lindemann–Weierstrass theorem
    Used in Corollary 3.10 to infer that positive critical exponents of finitely generated free actions are transcendental.
  • standard math Dickson's lemma on antichains in N^m
    Used in Lemma 4.3 and Theorem 4.4 to prove finiteness of length data realizing a fixed rate.
  • standard math Covering-space dictionary between free tree actions and graph coverings
    Section 2.2 (Proposition 2.2 and preceding) identifies deck groups with π1 of quotients; standard algebraic topology, but load-bearing for translating between actions and graphs.

pith-pipeline@v1.3.0-alltime-deepseek · 21632 in / 50227 out tokens · 416019 ms · 2026-08-01T07:56:54.087957+00:00 · methodology

0 comments
read the original abstract

For free type-preserving discrete actions on the biregular tree $\mathcal T_{r+1,s+1}$, we stratify the critical-exponent spectrum by quotient complexity. The unrestricted spectrum is the full interval $[0,\frac12\log(rs)]$, whereas the finitely generated spectrum is countable and dense and is encoded by the Hashimoto radii of finite typed cores. At fixed rank, finitely many typed kernels parametrize all values, and every nonzero accumulation belongs to a lower-rank stratum. Rank two admits a complete effective inverse classification through the figure-eight, theta, and dumbbell polynomial families.

Figures

Figures reproduced from arXiv: 2607.21294 by Sanghoon Kwon.

Figure 1
Figure 1. Figure 1: The spectral hierarchy. Infinite quotient complexity yields the full continuum; finite generation produces finite-state Hashimoto data; fixed rank leaves finitely many typed kernels, whose degenerations land in lower-rank strata; rank two has an explicit inverse classification. Theorem 1.2 (Fixed-rank stratification and rank drop). Fix g ≥ 2 and r, s ≥ 2. (i) There is a finite set Kg;r,s of typed kernels s… view at source ↗
Figure 2
Figure 2. Figure 2: Proof roadmap for the unrestricted free stratum. The first arrow supplies intrinsic block growth; the remaining arrows control how the blocks are assembled without changing the target exponent [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The sparse binary-coded block quotient before biregular completion. The orange vertex marks the typed basepoint. Each finite typed core is joined at the port opposite to the corresponding spine vertex. Corridor parities record the prescribed binary word, while their lengths control mixed normal forms. We next choose the corridor lengths. The reindexing (21) fixes which core lies at each marked vertex. For … view at source ↗
Figure 4
Figure 4. Figure 4: The three rank-two kernels. A label denotes the positive integral length of the corresponding subdivided kernel edge. Explicit Ihara zeta functions for all finite connected graphs without degree-one vertices and circuit rank two were computed by Kwon–Lee [13]; the zeta function was subsequently shown to be a complete invariant at rank two [6]. We use the kernel pressure equation to select the Perron root, … view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 6 linked inside Pith

  1. [1]

    Angel, J

    O. Angel, J. Friedman, and S. Hoory,The non-backtracking spectrum of the universal cover of a graph, Trans. Amer. Math. Soc.367(2015), no. 6, 4287–4318

    2015

  2. [2]

    Baker,Transcendental Number Theory, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1990

    A. Baker,Transcendental Number Theory, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1990

    1990

  3. [3]

    Bass,The Ihara–Selberg zeta function of a tree lattice, Internat

    H. Bass,The Ihara–Selberg zeta function of a tree lattice, Internat. J. Math.3(1992), no. 6, 717–797

    1992

  4. [4]

    Bass and A

    H. Bass and A. Lubotzky,Tree Lattices, Progress in Mathematics, vol. 176, Birkh¨ auser, Boston, 2001

    2001

  5. [5]

    Boyle and D

    M. Boyle and D. Handelman,The spectra of nonnegative matrices via symbolic dynamics, Ann. of Math. (2)133 (1991), no. 2, 249–316

    1991

  6. [6]

    Chico, T

    M. Chico, T. W. Mattman, and A. Richards,Ihara zeta functions for some simple graph families, preprint, arXiv:2501.00639 (2024)

    Pith/arXiv arXiv 2024

  7. [7]

    Coulon, M

    R. Coulon, M. Louvaris, D. T. Wise, and G. Yehuda,On the growth spectrum of hyperbolic groups, arXiv:2607.02147v1, 2026

    Pith/arXiv arXiv 2026

  8. [8]

    Eisner and S

    I. Eisner and S. Hoory,Entropy and the growth rate of universal covering trees, preprint, arXiv:2410.10337v3 (2026)

    Pith/arXiv arXiv 2026

  9. [9]

    Glover and M

    C. Glover and M. Kempton,Some spectral properties of the non-backtracking matrix of a graph, Linear Algebra Appl.618(2021), 37–57

    2021

  10. [10]

    Hashimoto,Zeta functions of finite graphs and representations of p-adic groups, inAutomorphic Forms and Geometry of Arithmetic Varieties, Adv

    K. Hashimoto,Zeta functions of finite graphs and representations of p-adic groups, inAutomorphic Forms and Geometry of Arithmetic Varieties, Adv. Stud. Pure Math.15, Academic Press, Boston, 1989, 211–280

    1989

  11. [11]

    Kotani and T

    M. Kotani and T. Sunada,Zeta functions of finite graphs, J. Math. Sci. Univ. Tokyo7(2000), 7–25

    2000

  12. [12]

    Kwon,On the set of critical exponents of discrete groups acting on regular trees, J

    S. Kwon,On the set of critical exponents of discrete groups acting on regular trees, J. Korean Math. Soc.56(2019), no. 2, 475–484

    2019

  13. [13]

    Kwon and S

    S. Kwon and S. Lee,Ihara zeta function of finite graphs with circuit rank two, Korean J. Math.28(2020), no. 1, 123–136

    2020

  14. [14]

    Lederle,Critical exponents of boomerang subgroups in the free group, preprint, arXiv:2512.20767v1 (2025)

    W. Lederle,Critical exponents of boomerang subgroups in the free group, preprint, arXiv:2512.20767v1 (2025)

    arXiv 2025

  15. [15]

    D. A. Lind,The entropies of topological Markov shifts and a related class of algebraic integers, Ergodic Theory Dynam. Systems4(1984), no. 2, 283–300

    1984

  16. [16]

    Louvaris, D

    M. Louvaris, D. T. Wise, and G. Yehuda,On the spectral radius of the non-backtracking matrix of the configuration model, arXiv:2404.07321v2, 2026. 28 SANGHOON KWON

    Pith/arXiv arXiv 2026

  17. [17]

    Louvaris, D

    M. Louvaris, D. T. Wise, and G. Yehuda,Subgroups of a free group with every growth rate, arXiv:2505.10650v1, 2025

    Pith/arXiv arXiv 2025

  18. [18]

    Puder,An extension of the cogrowth formula to arbitrary subsets of the tree, arXiv:2405.18169v2, 2024

    D. Puder,An extension of the cogrowth formula to arbitrary subsets of the tree, arXiv:2405.18169v2, 2024

    Pith/arXiv arXiv 2024

  19. [19]

    Serre,Trees, Springer Monographs in Mathematics, Springer, Berlin, 2003

    J.-P. Serre,Trees, Springer Monographs in Mathematics, Springer, Berlin, 2003

    2003

  20. [20]

    J. R. Stallings,Topology of finite graphs, Invent. Math.71(1983), no. 3, 551–565

    1983

  21. [21]

    Tim´ ar,Density of growth rates of subgroups of a free group—an alternative proof, arXiv:2601.12620v1, 2026

    ´A. Tim´ ar,Density of growth rates of subgroups of a free group—an alternative proof, arXiv:2601.12620v1, 2026

    arXiv 2026