pith. sign in

arxiv: 2606.06824 · v1 · pith:VRN67V2Wnew · submitted 2026-06-05 · 🧮 math.GR

Two-Generator Discrete Subgroups of Tree Automorphisms

Yukun Du This is my paper

Pith reviewed 2026-06-27 20:42 UTC · model grok-4.3

classification 🧮 math.GR
keywords discrete subgroupstree automorphismstrivalent treetwo-generator groupsquotient graphsPoincaré algorithmgraphs of groupsgroup actions on trees
0
0 comments X

The pith

Two-generator discrete subgroups of the trivalent tree automorphism group receive a partial classification when generators obey a bound on one geometric quantity.

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

The paper establishes a partial classification of two-generator discrete subgroups inside the automorphism group of the trivalent tree, but only for those generators that satisfy a restriction on a small geometric quantity. Under this restriction the authors obtain a complete list of isomorphism types. When the restriction on the quantity or the valency of the tree is dropped, the paper identifies the possible reduced quotient graphs and builds infinite families of graphs of groups on each of them. A generalized Poincaré algorithm is supplied that decides, for any finite set of tree automorphisms, whether they generate a discrete subgroup.

Core claim

The central claim is that two-generator discrete subgroups of the trivalent tree automorphism group admit a partial classification precisely when the generators meet a restriction on a small geometric quantity; under that restriction the subgroups fall into a finite list of isomorphism types. When the restriction is relaxed the possible reduced quotient graphs are described and infinite families of graphs of groups are constructed on each. The paper also supplies a generalized Poincaré algorithm that determines discreteness for any given finite collection of tree automorphisms.

What carries the argument

The bound on the geometric quantity for the two generators, which makes a complete enumeration of isomorphism types feasible, together with the reduced quotient graphs and the generalized Poincaré algorithm for testing discreteness.

If this is right

  • All two-generator discrete subgroups obeying the geometric bound fall into one of finitely many isomorphism types.
  • When the geometric bound or the tree valency is removed, every possible reduced quotient graph supports an infinite family of graphs of groups.
  • The generalized Poincaré algorithm decides discreteness for arbitrary finite sets of tree automorphisms.
  • The same methods apply directly to trees of any fixed valency once the geometric restriction is adjusted.

Where Pith is reading between the lines

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

  • The two-generator classification could serve as a base case for inductive descriptions of discrete subgroups generated by more than two elements.
  • The quotient-graph families might be used to produce explicit examples of discrete groups with prescribed properties such as finite covolume or prescribed stabilizers.
  • The algorithm supplies a practical test that could be implemented to scan random pairs of automorphisms for discreteness.

Load-bearing premise

The chosen bound on the geometric quantity is the threshold that separates the cases where a complete list of isomorphism types can be written down from those where it cannot.

What would settle it

An explicit pair of generators that obeys the geometric restriction yet produces a discrete subgroup whose isomorphism type is absent from the listed types would falsify the classification.

Figures

Figures reproduced from arXiv: 2606.06824 by Yukun Du.

Figure 4.1
Figure 4.1. Figure 4.1: The shorthand used to specify when the edge groups are properly contained in the vertex groups. Any edge in a graph of groups falls into one of the three cases illustrated above. The reduction of a graph of groups can then be understood through this doubled graph. Namely, if either half of an edge e is not doubled, we may shrink the edge and merge the incident vertices v1 and v2. It is clear that the red… view at source ↗
Figure 4.2
Figure 4.2. Figure 4.2: If the edge e is single, then after reduction we keep the style of the other edges incident with v1 and v2. If the half of e near v2 is doubled, then after reduction we double the half-edges coming from edges incident with v1, regardless of their styles before reduction. To obtain graphs of groups subject to reduction, we require a strengthened version of Theorem 4.2: Proposition 4.1. Let n ≥ 2, and let … view at source ↗
Figure 4.3
Figure 4.3. Figure 4.3: Upper diagram: n = 6 and val(v) = 10. Bottom diagram: n = 3 and val(v) = 4. The resulting graph Y0 satisfies the inequality requirement, and by Theorem 4.2, we are able to construct an elliptic-hyperbolic generated subgroup Γ = ⟨g, h⟩ < Aut(Xn) such that l = ℓ(h), d(Tg, Ah) = 0, and its minimal quotient graph of groups is (Y0, G0), with the indices for the boundary monomorphisms agreeing with the selecte… view at source ↗
read the original abstract

We present a partial classification of two-generator discrete subgroups of the trivalent tree automorphism group, specifically for cases where the generators satisfy a restriction on a small geometric quantity. When the restrictions on the geometric quantity or tree valency are relaxed, we discuss the possible reduced quotient graphs for these subgroups and construct infinite families of graphs of groups on each. Additionally, we include a generalized Poincar\'e algorithm that determines whether a given set of tree automorphisms generates a discrete subgroup.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript presents a partial classification of two-generator discrete subgroups of the automorphism group of the trivalent tree, restricted to generators satisfying a bound on a small geometric quantity. It constructs infinite families of reduced quotient graphs (and graphs of groups) when this bound or the tree valency is relaxed, and supplies a generalized Poincaré algorithm for verifying that a given set of tree automorphisms generates a discrete subgroup.

Significance. A rigorously supported classification of this form would supply concrete isomorphism types for discrete actions on trees in a controlled regime, complementing existing work on tree automorphism groups and their quotients. The generalized Poincaré algorithm is a reusable tool whose correctness would be independently valuable for computational checks of discreteness. The explicit construction of infinite families upon relaxing the bound is a strength that could demonstrate sharpness, provided the separation between the classified and unclassified regimes is justified.

major comments (1)
  1. [Abstract / main theorem] Abstract and main classification statement: the manuscript asserts that relaxing the restriction on the geometric quantity produces infinite families of graphs of groups, yet supplies no lemma, proposition, or explicit computation establishing why the chosen numerical cutoff is the threshold at which the possible reduced quotient graphs become limited enough for exhaustive enumeration. Without this separation argument the restriction risks appearing ad hoc rather than canonical, undermining the claim that the partial list is complete within the stated regime.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for highlighting the need for a clearer justification of the geometric bound in our partial classification. We address this point below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract / main theorem] Abstract and main classification statement: the manuscript asserts that relaxing the restriction on the geometric quantity produces infinite families of graphs of groups, yet supplies no lemma, proposition, or explicit computation establishing why the chosen numerical cutoff is the threshold at which the possible reduced quotient graphs become limited enough for exhaustive enumeration. Without this separation argument the restriction risks appearing ad hoc rather than canonical, undermining the claim that the partial list is complete within the stated regime.

    Authors: We acknowledge that the manuscript lacks an explicit lemma or computational proposition that rigorously separates the chosen cutoff from larger values. The bound was selected after preliminary machine-assisted enumeration showed that, below this threshold, only finitely many reduced quotient graphs arise and can be exhaustively listed, while the constructions in the later sections demonstrate that relaxing the bound immediately yields infinite families. To strengthen the presentation we will insert a new proposition (or expanded remark) that records the computational evidence for finiteness below the cutoff and sketches why the first infinite families appear precisely when the bound is exceeded. This addition will make the regime canonical rather than ad hoc. revision: yes

Circularity Check

0 steps flagged

No circularity: partial classification under explicit restriction is self-contained

full rationale

The paper presents a partial classification of two-generator discrete subgroups of the trivalent tree automorphism group under an explicitly stated restriction on a geometric quantity, along with a generalized Poincaré algorithm and discussion of relaxed cases. No equations, fitted parameters, or self-definitional reductions appear in the abstract or described content. The restriction is introduced as the scope condition enabling the enumeration rather than being derived from or equivalent to the classification output itself. No self-citation chains, uniqueness theorems from prior author work, or ansatzes smuggled via citation are referenced in the provided material. The work is therefore self-contained as an enumeration within chosen bounds, with no load-bearing step reducing to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated.

pith-pipeline@v0.9.1-grok · 5587 in / 1058 out tokens · 14922 ms · 2026-06-27T20:42:20.129336+00:00 · methodology

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

23 extracted references · 1 canonical work pages

  1. [1]

    2002 , publisher=

    Trees , author=. 2002 , publisher=

    2002

  2. [2]

    Journal d’Analyse Math

    A characterization of Schottky groups , author=. Journal d’Analyse Math. 1967 , publisher=

    1967

  3. [3]

    The American Mathematical Monthly , volume=

    The three gap theorem and the space of lattices , author=. The American Mathematical Monthly , volume=. 2017 , publisher=

    2017

  4. [4]

    2006 , publisher=

    Foundations of hyperbolic manifolds , author=. 2006 , publisher=

    2006

  5. [5]

    Mathematical Proceedings of the Cambridge Philosophical Society , volume=

    Gaps and steps for the sequence n mod 1 , author=. Mathematical Proceedings of the Cambridge Philosophical Society , volume=. 1967 , organization=

    1967

  6. [6]

    1989 , publisher=

    Groups acting on graphs , author=. 1989 , publisher=

    1989

  7. [7]

    Annals of Mathematics , volume=

    Automorphisms of trivalent graphs , author=. Annals of Mathematics , volume=. 1980 , publisher=

    1980

  8. [8]

    Journal of Combinatorial Theory, Series B , volume=

    Regular groups of automorphisms of cubic graphs , author=. Journal of Combinatorial Theory, Series B , volume=

  9. [9]

    Discrete two-generator subgroups of

    Conder, Matthew J and Schillewaert, Jeroen , journal=. Discrete two-generator subgroups of

  10. [10]

    2022 , school=

    Applications of the amalgam method to the study of locally projective graphs , author=. 2022 , school=

    2022

  11. [11]

    arXiv preprint arXiv:2502.02250 , year=

    Edge-transitive cubic graphs: Cataloguing and Enumeration , author=. arXiv preprint arXiv:2502.02250 , year=

    work page arXiv

  12. [12]

    Proceedings of the American Mathematical Society , volume=

    A class of finite group-amalgams , author=. Proceedings of the American Mathematical Society , volume=

  13. [13]

    All generating pairs of all two-generator

    Rosenberger, Gerhard , journal=. All generating pairs of all two-generator. 1986 , publisher=

    1986

  14. [14]

    , journal=

    Conder, Matthew J. , journal=. Discrete and free two-generated subgroups of. 2020 , publisher=

    2020

  15. [15]

    Free and Discrete Generating Pairs of Tree Automorphisms , howpublished =

    Du, Yukun and Hersonsky, Saar , publisher =. Free and Discrete Generating Pairs of Tree Automorphisms , howpublished =. 2025 , journal=

    2025

  16. [16]

    Two-Generator Discrete Subgoups of

    Gilman, Jane , volume=. Two-Generator Discrete Subgoups of. 1995 , publisher=

    1995

  17. [17]

    Israel Journal of Mathematics , volume=

    The classification of discrete 2-generator subgroups of PSL (2, R) , author=. Israel Journal of Mathematics , volume=. 1982 , publisher=

    1982

  18. [18]

    Journal of the American Mathematical Society , volume=

    Uniform tree lattices , author=. Journal of the American Mathematical Society , volume=. 1990 , publisher=

    1990

  19. [19]

    Lattices in rank one

    Lubotzky, Alexander , journal=. Lattices in rank one. 1991 , publisher=

    1991

  20. [20]

    The constructive membership problem for discrete two-generator subgroups of

    Kirschmer, Markus and R. The constructive membership problem for discrete two-generator subgroups of. Journal of Algebra , volume=. 2017 , publisher=

    2017

  21. [21]

    Applications of a computer implementation of

    Riley, Robert , journal=. Applications of a computer implementation of

  22. [22]

    On a theory of computation and complexity over the real numbers:

    Blum, Lenore and Shub, Mike and Smale, Steve , journal=. On a theory of computation and complexity over the real numbers:

  23. [23]

    Handbook of geometric topology , pages=

    R-trees in topology, geometry, and group theory , author=. Handbook of geometric topology , pages=