Pith. sign in

REVIEW 2 major objections 6 minor 61 references

A graph-theoretical characterisation of subgroups of Thompson's group $V$

T0 review · 2 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read Subgroups of Thompson's V are exactly the context-free transition groups.

desk verdict A strong, credible characterization of finitely generated subgroups of V as CF-TR; the main soft spot is that the key embedding step imports load-bearing machinery from the authors' companion paper rather than proving it here. read the letter →

arxiv 2608.02111 v1 pith:IPHD4GJR submitted 2026-08-03 math.GR cs.FLmath.CO

Corentin Bodart , Daniele D'Angeli , Davide Perego , Emanuele Rodaro This is my paper · ORCID
classification math.GRcs.FLmath.CO MSC 20F6520F10
keywords Thompson'sgroupVcontext-freegraphsCF-TRgroupsco-context-freeSchreierquasi-treesintermediategrowthHanoiTowers
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 proves that a finitely generated group embeds in Thompson's group V if and only if it admits a faithful context-free action, meaning it is the transition group of a finite union of complete context-free graphs. The proof runs through a new geometric encoding: Schreier graphs of V-actions are context-free, and every context-free transition group embeds into the topological full group of an irreducible edge shift, which in turn embeds into V. On this basis the paper proves an alternative: every finitely generated subgroup of V is either virtually abelian or contains a free non-abelian semigroup, so no group of intermediate growth embeds in V. It also shows that the Basilica group and the Hanoi Towers groups do not embed in V, by comparing the quasi-tree geometry of Schreier graphs of V with non-quasi-tree Schreier graphs of those groups. If correct, the result reframes the co-context-free conjecture as the statement that a group is co-context-free exactly when it is CF-TR, with V no longer appearing in the formulation.

What carries the argument

The central object is the transition group G(Γ) of a context-free graph Γ: a connected labelled graph whose cycle languages are context-free, with G(Γ) generated by the label-induced permutations on vertices. The load-bearing encoding, imported from the companion paper [22], parametrizes each vertex x by a well-formed word w_x over the end-cone type graph, with the property that w_x and w_{xa} differ only in a short suffix; reversing these words converts short suffixes into short prefixes, which matches the prefix-replacement definition of V, and lets each generator of G(Γ) act on an edge shift by a homeomorphism that replaces prefixes. This encoding, together with the end-cone type graph of Muller–Schupp, carries the entire equivalence: it gives the pushdown automata for Schreier graphs in one direction and the edge-shift embedding in the other.

What would settle it

Check the bijection between vertices of a small context-free graph and minimal circuits through v0 in the associated edge-shift graph Σ constructed in Proposition 2.8: for a graph with two end-cone types where two distinct vertices produce identical reversed well-formed words, the embedding ψ would not be well-defined. Concretely, compute the pushdown automaton of Proposition 2.1 for a specific two-generator subgroup of V and the periodic point 0∞; if the automaton accepts any word that does not fix 0∞, or rejects one that does, the claimed characterization of Schreier graphs fails.

Watch

Extended reading notes

Core claim

The central claim, Theorem A, is an equivalence: a finitely generated group G embeds in Thompson's group V if and only if G is CF-TR, meaning G admits a faithful action with finitely many orbits whose orbital Schreier graphs are all context-free (equivalently, G is a transition group of a finite union of complete context-free graphs). The forward direction shows that every Schreier graph Sch(ξ, G; A) of a finitely generated subgroup G of V on an eventually periodic point is context-free, via a pushdown automaton that tracks prefixes of the eventually periodic word; faithfulness is achieved on the dense set of eventually periodic points, and reduction to finitely many orbits uses the fact that such Schreier graphs fall into finitely many isomorphism classes. The reverse direction embeds any context-free transition group into the topological full group F(Σ, v0) of an initial one-sided irreducible edge shift, by coding vertices of the graph as well-formed words over the end-cone type graph and observing that multiplying by a generator only changes a short suffix; a cited result on topological full groups then embeds such full groups into V. The embedding works even though the edge shift is a proper subshift, because the coding set X of reversed well-formed words is dense in the shift space, so faithfulness on X implies faithfulness on the whole shift.

Load-bearing premise

The argument depends on the correctness of the well-formed-words encoding of context-free graphs borrowed from the companion paper [22] — specifically that each vertex of the graph corresponds to exactly one minimal circuit in the edge-shift graph, and that the encodings of adjacent vertices differ only in a short suffix. If that encoding is flawed, the construction embedding CF-TR groups into edge-shift full groups, and hence into V, collapses.

Editorial extensions

If this is right

  • The co-context-free conjecture reduces to the statement that a group is co-context-free if and only if it is CF-TR, and the paper proves that every previously known co-context-free group is CF-TR and hence embeds in V.
  • Every finitely generated subgroup of V is either virtually abelian or contains a free non-abelian semigroup; consequently, no group of intermediate growth embeds in V.
  • The Basilica group and the Hanoi Towers groups do not embed in V, by comparing quasi-tree Schreier graphs with non-quasi-tree Schreier graphs.
  • Transition groups of context-free graphs of polynomial growth are elementary amenable, with EA-class at most d + 1.
  • Context-free graphs of linear growth correspond exactly to finite-index subgroups that embed in Houghton groups H_m.

Reading between the lines

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

  • A testable consequence left implicit by the paper: if the equivalence holds verbatim, then a co-context-free group that is not CF-TR would have no faithful action whose orbical Schreier graphs are context-free; searching for such a group would pinpoint exactly where the gap between co-context-free and CF-TR lies.
  • The theorem that finitely generated subgroups of V are virtually abelian or contain free semigroups suggests probing the boundary: candidate groups to test include polycyclic groups with Hirsch length at least 3, whose distorted cyclic subgroups should forbid embedding into V by the same argument used for virtually nilpotent groups.
  • Lemma 7.1 is stated for graph coverings of Schreier graphs, but the proof only uses non-expansiveness of the covering map on paths; extending it to coarse Lipschitz surjections would generalize the non-embedding results to actions that are not necessarily Schreier graphs of the group.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. The paper proves a graph-theoretic characterization of finitely generated subgroups of Thompson's group V: a finitely generated group embeds in V if and only if it is CF-TR, i.e., a transition group of a finite disjoint union of context-free graphs (Theorem A). The forward direction is proved by explicit pushdown automata recognizing the stabilizers of eventually periodic points (Section 2.1), and the reverse direction uses a coding of context-free graphs by well-formed words and embeds their transition groups into topological full groups of irreducible edge shifts, then into V via Matui's theorem (Sections 2.3–2.4). The paper then derives substantial applications: embeddings of V(H,θ) and of Farley's FSS groups (Theorem B), a dichotomy for finitely generated subgroups of V (virtually abelian or containing a nonabelian free semigroup, Theorem C), non-embeddability of intermediate-growth groups (Corollary D), graph-covering and limit results with consequences for polynomial-growth transition groups, and non-embeddability of Basilica and Hanoi Towers groups (Theorem E).

Significance. If the main characterization is correct, it gives a sharp graph-theoretical description of all finitely generated subgroups of Thompson's V, a new formulation of Lehnert's conjecture, uniform embeddings for previously known co-context-free groups, and new obstruction tools. The paper is well structured and contains explicit pushdown automata for the positive embedding results, which is a genuine strength. The main risk is the heavy dependence of the reverse direction of Theorem A on the authors' companion paper [22]: Proposition 2.8, the hinge of that direction, imports the well-formed-words coding and the 'short suffix change' property from [22, Lemmas 7.3 and 7.6] without stating or proving them. Since an undetected defect there would invalidate the central theorem, this dependence should be made explicit and self-contained before the paper can be accepted.

major comments (2)
  1. [Section 2.3, Proposition 2.8] The implication 'CF-TR implies embeds in V' rests on this proposition, but the proof is not self-contained at the decisive point. The definition of the edge-shift graph Σ uses the vertex set V = {v0} ∪ {Γ_j | Γ_j ≠ ∆_j}, and the symbol ∆_j is never defined in the manuscript. More importantly, the well-definedness of the map ψ(a) depends on two properties imported from [22]: that minimal circuits through v0 in Σ are in bijection with vertices of Γ ([22, Lemma 7.3]), and that the words w_x and w_xa differ only in a short suffix whose replacement is determined by a and the old suffix ([22, Lemma 7.6]). These two properties are exactly what make the family {reverse(w_x)} prefix-free and the prefix replacement finite; without them, ψ(a) need not be single-valued on overlaps of cylinders, and the extension to an element of F(Σ,v0) is not justified. The manuscript states the three suffix-change cases and then refers to 'the proof of [22, Lemma 7.6]' rather than giving the argument. Since Proposition 2.8 is the load-bearing step of Theorem A, the authors should either state and prove [22, Lemmas 7.3 and 7.6] (or self-contained versions), or explicitly formulate them as imported theorems with their full statements. As written, a reader cannot verify the central step.
  2. [Section 2.3, Proposition 2.8 and Theorem 2.9] The proof of Proposition 2.8 assumes that every graph that is not a single vertex has at least two end-cone types. This is not established, and it is false for natural complete context-free graphs: for example, the Cayley graph of a nonabelian free group with a symmetric generating set is a regular tree, has a single end-cone type, and is a complete context-free graph whose transition group is the free group itself; finite graphs with more than one vertex also do not fit the stated case split. Since Theorem 2.9 applies Proposition 2.8 to every component in a CF-TR representation, the proof as written does not formally cover these components. This is readily fixable—finite transition groups embed in V, and the one-type case can be treated separately—but it must be addressed for the proof of Theorem A to cover all CF-TR groups.
minor comments (6)
  1. [Section 2.3, Proposition 2.8] The displayed equivalence in the proof of Proposition 2.8 contains a corrupted symbol `!=` in the condition for φ(u) = 1; it should evidently read `=`.
  2. [Section 2.3, Proposition 2.8] The notation `∆_j` in the definition of the vertex set of Σ is undefined; please define it or correct the intended notation.
  3. [Section 2.2, Proposition 2.5] The assertion that 'context-free graphs are quasi-trees' is used to deduce Proposition 2.5 from Proposition 2.1, but no proof or reference is given for this implication. Please add a citation or a one-sentence explanation, since it is not immediate from Definition 1.7.
  4. [Section 3.1, Proposition 3.1] The displayed split exact sequence before Proposition 3.1 is typeset incorrectly ('1 L∞ i=1H V(H,θ) V 1.π'); it should be a proper exact sequence with the indicated groups.
  5. [Section 7, Lemma 7.1] The paths x_i, y_j, z_j used in the proof of Lemma 7.1 are only described in Figure 16 and not defined in the text. Please define them explicitly so that the construction of the words a and b can be checked without decoding the figure.
  6. [References] Reference [38] is cited as 'in preparation'. If it has appeared by the time of publication, the citation should be updated; otherwise it would be helpful to mark it clearly as an unpublished independent proof.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: Theorem A is proved by explicit pushdown automata and an external Matui embedding; reliance on the companion paper [22] is a dependency, not a reduction of the conclusion to its inputs.

full rationale

The central derivation is not circular. The forward direction (finitely generated subgroups of V are CF-TR) is proved by constructing an explicit pushdown automaton from the given prefix-replacement generators of the subgroup (Proposition 2.1), with Lemma 2.2 controlling the finite number of isomorphism classes via Muller–Schupp end-cone types. The reverse direction (CF-TR groups embed in V) goes through Proposition 2.8, which embeds the transition group G(Γ) into the topological full group F(Σ,v0) of an irreducible edge shift, and then Theorem 2.9 passes to V using Matui's independent theorem [48, Proposition 5.14]/[46, Corollary 11.15]. Proposition 2.8 does import the well-formed-word encoding from the authors' companion paper [22, Lemmas 7.3 and 7.6], and the proof of the suffix analysis is deferred to [22, Lemma 7.6]. This is a genuine dependency on prior work, including work by overlapping authors, but it is not circularity: the cited lemmas concern encodings of vertices of a context-free graph by words over the end-cone-type graph, and their assumptions (Γ is a context-free graph with finitely many end-cone types) do not include the target conclusion that CF-TR groups embed in V. The final, load-bearing step into Thompson's group V is supplied by Matui's theorem, an external result, and the converse direction is self-contained. The corollaries (Theorems C, D, E) are tested against independent external inputs: Chou's theorem on elementary amenable groups, the Le Boudec–Matte Bon commensurator/URS dichotomy [42, Corollary 5.20], and explicit geometric analysis of Schreier graphs of Basilica and Hanoi Towers actions. No fitted parameter is renamed as a prediction, no uniqueness theorem from the authors' own prior work is invoked to rule out alternatives, and the CF-TR class is not defined in terms of embeddability in V. If the companion-paper encoding lemma were false, the proof of Theorem A would fail, but that is a correctness or provenance risk, not a circular reduction.

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

Pure mathematics paper with no empirical fitting, so there are no free parameters in the data-fitting sense: the numeric quantities in the proofs (number of end-cone types, the finite set F in Proposition 5.1, the Landau function bound on element orders in B_F) are derived, not fitted. The central claim rests on standard cited theorems (Muller-Schupp, Matui, Chou, Burillo-Cleary-Rover, Le Boudec-Matte Bon, Francoeur) and on the technical framework of the authors' own earlier paper [22], which supplies the CF-TR definition, the well-formed-words encoding (Lemmas 7.3 and 7.6), and closure properties (Lemma 4.6, Propositions 4.16 and 4.20). The heaviest unproven dependency is [22], so an auditor should check those lemmas. There are no invented entities: the aperiodic limit graphs of Proposition 5.4, the spine graphs of Section 4.2, and the edge-shift graphs of Proposition 2.8 are explicitly constructed from the input context-free graphs.

assumptions (8)
  • standard math Muller-Schupp / Ceccherini-Silberstein-Woess: a connected inverse graph is context-free if and only if it has finitely many end-cone types (Theorem 1.9).
    Cited background theorem used throughout as the geometric characterization of context-free graphs and as the source of the growth dichotomy in Lemma 1.10.
  • standard math Matui: topological full groups of irreducible (initial) edge shifts are finitely generated and embed in V ([48, Proposition 5.14], [46, Corollary 11.15], [57, Section 8.3]).
    The external anchor closing the 'CF-TR implies embeds in V' direction: Proposition 2.8 embeds G(Gamma) into F(Sigma, v0), then Theorem 2.9 appeals to Matui to reach V.
  • domain assumption The CF-TR framework and technical machinery of [22]: well-formed-words encoding of vertices, [22, Lemmas 7.3 and 7.6] (circuit-vertex bijection; short-suffix difference of w_x and w_xa), [22, Lemma 4.6] (transition group of a disjoint union), [22, Propositions 4.16 and 4.20] (closure properties of…
    Load-bearing for Proposition 2.8 and Theorem 6.1; [22] is a peer-reviewed paper by three of the four present authors, and this text defers to it rather than reproving the encoding.
  • standard math Chou's theorem: finitely generated elementary amenable groups are virtually nilpotent or contain a free non-abelian semigroup ([19, Theorem 3.2']).
    Used in the polynomial-growth half of Theorem 6.11 after Theorem 6.4 establishes elementary amenability.
  • standard math Finitely generated virtually nilpotent subgroups of V are virtually abelian ([17, Corollary 1.10]).
    Used in Theorem 6.11 to sharpen the virtually nilpotent alternative into the announced virtually abelian or free semigroup dichotomy.
  • standard math Le Boudec-Matte Bon rigidity: the URS dichotomy for confined subgroups of weakly branch groups ([42, Corollary 5.20]) and the associated commutator lemma framework.
    Load-bearing for Theorem 7.2: the dichotomy either traps a URS in a point stabilizer (yielding a free subgroup through Lemma 7.1) or forces a derived rigid stabilizer into the kernel.
  • standard math Francoeur's finite-generation results for branch groups ([26, Theorem A.4]) and Lemma 7.7 (normal subgroups of the Basilica group are finitely generated, credited to Francoeur).
    Needed for condition (a) of Theorem 7.2 in the Basilica case; the proof sketch uses [32, Proposition 6] and [25, Proposition 4.7].
  • standard math Stabilizers of aperiodic points in V coincide with germ stabilizers (used in Proposition 2.5).
    Stated as an 'easy exercise' in Lemma 2.7 and argued from piecewise-linearity with rational breakpoints; it makes the Chabauty limit argument for quasi-tree Schreier graphs work.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A graph-theoretical characterisation of subgroups of Thompson's group $V$." pith.science (2026). https://pith.science/paper/IPHD4GJR

@misc{pith2026260802111,
  author       = {Pith},
  title        = {Pith review of: A graph-theoretical characterisation of subgroups of Thompson's group $V$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IPHD4GJR}},
  note         = {Machine review of arXiv:2608.02111}
}
abstract

We prove a graph-theoretical characterisation of finitely generated subgroups of Thompson's group $V$: a finitely generated group embeds in $V$ if and only if it admits a faithful context-free action, or equivalently if it belongs to the class CF-TR of transition groups of context-free graphs recently introduced by Matucci and the three last authors. Using this characterisation, we prove results in different directions: - All known examples of groups with co-context-free Word Problem do embed in $V$, providing evidence towards Lehnert's conjecture. - Each finitely generated subgroup of $V$ is either virtually abelian, or contains a free non-abelian semigroup. It follows that groups of intermediate growth do not embed in Thompson's $V$. We further study the relation between transition groups defined by graphs that are limits or covers of each others, and prove properties of transition groups of context-free graphs of polynomial growth. Finally, we prove that the Basilica and Hano\"i Towers groups do not embed in $V$. This uses the geometry of Schreier graphs of the natural actions of these groups and of Thompson's $V$.

Figures

Figures reproduced from arXiv: 2608.02111 by the authors.

Figure 1
Figure 1. An element of V , defined by (aj , bj ) = (00, 10),(01, 0),(1, 11) 1.2 Inverse graphs and their transition groups We recall the definition of (labelled) (di-)graphs, in the sense of Serre: Definition 1.1. An inverse A-graph is a tuple Γ = (V, E, ι, τ, λ, · −1 ) where • V is the vertex set and E is the edge set, • ι: E → V (resp. τ ) maps each edge to its initial (resp. terminal) vertex, 4 [PITH_FULL_IMAGE:figures/f… view at source ↗
Figure 2
Figure 2. The two types of subgraphs of D(Γ) witnessing growth of Γ. Proof. It only remains to justify β¯ Γ(r) ⪯ r d in the second case. Fix r ⩾ 0 and a vertex x ∈ Γ, and let w = Γ(x, x0) ∈ L be the associated end-cone. Let u be the shortest word in the ball DL r (w), of type Γj . Then f(DΓ r (x)) ⊆ DL r (w) ⊆ DL 2r (u) ∩ {uv ∈ L} = u {v labels a path from Γj : |v| ⩽ 2r}, hence #DΓ r (x) ⩽ maxi |∆i | · β(Lj ,ε) (2r) ⪯ (2r) d … view at source ↗
Figure 3
Figure 3. A context-free graph Γ, and the associated end-cone type graph [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (14 more)
Figure 4
Figure 4. Figure 4: The pushdown automaton recognizing L [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]
Figure 6
Figure 6. Figure 6: The graph Σ defining the edge shift for G(Γ). 15 [PITH_FULL_IMAGE:figures/full_fig_p015_6.png]
Figure 7
Figure 7. Figure 7: Two elements g1, g2. To compose two elements g1 = {(ai , bi , hi)} and g2 = {(ci , di , ki)}, ensure that bi = ci by taking the refinements, and then let g1g2 = {(ai , di , hiki)}. That being said, composition is also best understood pictorially: g1g2 0 10 11 (10, g) 0…
Figure 8
Figure 8. Figure 8: The product g1g2. There is a map onto V , forgetting the labels. More strongly, combining Observations 2.28, 2.29 and Lemma 3.2 of [59] gives a split exact sequence 1 L∞ i=1 H V(H,θ) V 1. π This can be improved into an embedding in an unrestricted wreath product. Let D…
Figure 9
Figure 9. Figure 9: A covering π : Γ ↠ Λ with a thin spine. F and π −1 (F) in dashes. 4.2 Preserving context-freeness Suppose that π : Γ ↠ Λ has a thin spine, as defined in the previous section. We construct a “spine” graph Sp(Γ,Λ) that fully encodes the covering: • The vertex set is π −1…
Figure 10
Figure 10. Figure 10: Sp(⃗Γi , Z\ ⃗Γi), formed of copies of complete graphs and F. Sp(⃗Γi , Z\ ⃗Γi) has finitely many end-cone types, which concludes. Remark 5.5. We call ⃗Γi a periodic limit of Γi . The graph ⃗Γi depends on the choice of y, z, however we will not record this dependence in…
Figure 11
Figure 11. Figure 11: A context-free graph Ω3 such that H3 ≃ G(Ω3). (b) ⇒ (a): This follows from the fact that Hm is defined by a context-free graph of linear growth (see [PITH_FULL_IMAGE:figures/full_fig_p031_11.png]
Figure 12
Figure 12. Figure 12: An automaton generating C2 ≀ Z with C2 = ⟨a⟩ and Z = ⟨t⟩. The orbital Schreier graphs are described as follows: • For ξ ∈ {1, 3}∞, the graph Sch(ξ, G; A) is a copy of Z formed by t-edges, with a-self￾loops at every vertex. • Otherwise, say the first digit from {0, 2} …
Figure 13
Figure 13. Figure 13: A 1-ended context-free graph Γ for G = Z ⋊ C2, together with a 2-ended subgraph Λ for H = Z. Remark 6.14. There exist two-ended context-free graphs Γ such that G(Γ) contains a free semigroup. For instance, the lamplighter group C2 ≀ Z and the lampshuffler group FSym(Z…
Figure 14
Figure 14. Figure 14: A context-free graph for the lamplighter group [PITH_FULL_IMAGE:figures/full_fig_p036_14.png]
Figure 16
Figure 16. Figure 16: A K-fat R2 minor, together with associated paths. Take the obvious path labelled by w(a, b) in the minor, a lift in Γ, and consider its (con￾tinuous) image through f in T. This latest path can be decomposed as a concatenation segments s1s2 . . . sℓ which alternates co…
Figure 17
Figure 17. Figure 17: Image of the lifted path in T 7.1 Some weakly branch groups Consider a group G acting on a rooted tree T. As shown in Corollary 6.7, the Schreier graphs Sch(ξ, G; A) (with ξ ∈ ∂T) are not context-free for a wide family of groups. Since these are the only “natural” Sch…
Figure 18
Figure 18. Figure 18: Part of Sch(1ω, Gn; A) witnessing the failure of the bottleneck criterion. (We omit all ξk suffixes.) 39 [PITH_FULL_IMAGE:figures/full_fig_p039_18.png]
Figure 19
Figure 19. Figure 19: A typical orbital Schreier graph of B ↷ ∂T2, with arbitrarily long isometrically embedded cycles. Lemma 7.7. Normal subgroups of the Basilica group are finitely generated. Proof. We check the hypotheses of [26, Theorem A.4]. The Basilica group B is regularly 40 [PITH…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 58 canonical work pages

  1. [22]

    Context-free graphs and their transition groups

    Daniele D’Angeli, Francesco Matucci, Davide Perego, and Emanuele Rodaro. “Context-free graphs and their transition groups”. In:Transactions of the London Mathematical Society 13.1 (2026), e70034

    work page 2026

  2. [1]

    The group languages

    Anatoly V. Anisimov. “The group languages”. In:Kibernetika (Kiev)7.4 (1971), pp. 18–24

    work page 1971

  3. [2]

    Some embeddings between symmetric R. Thompson groups

    Julio Aroca and Collin Bleak. “Some embeddings between symmetric R. Thompson groups”. In:Proceedings of the Edinburgh Mathematical Society65.1 (2022), pp. 1–18

    work page 2022

  4. [3]

    Branch groups

    Laurent Bartholdi, Rostislav Grigorchuk, and Zoran Sunik. “Branch groups”. In:Mathemat- ical Notes67 (2005), pp. 718–723

    work page 2005

  5. [4]

    Progress around the Boone–Higman conjecture

    James Belk, Collin Bleak, Francesco Matucci, and Matthew C. B. Zaremsky. “Progress around the Boone–Higman conjecture”. In:EMS Surveys in Mathematical Sciences(June 2025)

    work page 2025

  6. [5]

    On plausible counterexamples to Lehnert’s conjecture

    Daniel Bennett. “On plausible counterexamples to Lehnert’s conjecture”. PhD thesis. Uni- versity of St Andrews, 2018

    work page 2018

  7. [6]

    A dynamical definition of f.g. virtually free groups

    Daniel Bennett and Collin Bleak. “A dynamical definition of f.g. virtually free groups”. In: International Journal of Algebra and Computation26.01 (2016), pp. 105–121. 41

    work page 2016

  8. [7]

    Groups with Context-free Co-word Problem and Embeddings into Thompson’s GroupV

    Rose Berns-Zieve, Dana Fry, Johnny Gillings, Hannah Hoganson, and Heather Mathews. “Groups with Context-free Co-word Problem and Embeddings into Thompson’s GroupV”. In:Topological Methods in Group Theory. London Mathematical Society Lecture Note Series. Cambridge University Press, 2018, pp. 19–37

    work page 2018

Show all 61 references
  1. [8]

    Alex Bishop, Corentin Bodart, Letizia Issini, and Davide Perego.Period growth and co- context-free groups.https://arxiv.org/abs/2601.13058. 2026

    2026

  2. [9]

    On the ET0L subgroup membership problem in bounded automata groups

    Alex Bishop, Daniele D’Angeli, Francesco Matucci, Tatiana Nagnibeda, Davide Perego, and Emanuele Rodaro. “On the ET0L subgroup membership problem in bounded automata groups”. In:Journal of the London Mathematical Society113.4 (2026), e70538

    2026

  3. [10]

    Complexity among the finitely generated subgroups of Thompson’s group

    Collin Bleak, Matthew G. Brin, and Justin Tatch Moore. “Complexity among the finitely generated subgroups of Thompson’s group”. In:J. Comb. Algebra5.1 (2021), pp. 1–58

    2021

  4. [11]

    Embeddings into Thompson’s group Vand coCF groups

    Collin Bleak, Francesco Matucci, and Max Neunh¨ offer. “Embeddings into Thompson’s group Vand coCF groups”. In:J. Lond. Math. Soc. (2)94.2 (2016), pp. 583–597

    2016

  5. [12]

    Topological full groups of minimal subshifts with subgroups of interme- diate growth

    Nicol´ as Matte Bon. “Topological full groups of minimal subshifts with subgroups of interme- diate growth”. In:Journal of Modern Dynamics9.1 (2015), pp. 67–80

    2015

  6. [13]

    Nicol´ as Matte Bon, Volodymyr Nekrashevych, and Tianyi Zheng.Commensurating actions and self-similar groups.https://arxiv.org/abs/2607.13776. 2026

    2026 arXiv

  7. [14]

    Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces

    Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, Fran¸ cois Pirot, and Alexander Scott. “Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces”. In:Journal of the European Mathematical Society 26.10 (2023), pp. 3739–3791

    2023

  8. [15]

    Growth of Schreier graphs of automaton groups

    Ievgen V. Bondarenko. “Growth of Schreier graphs of automaton groups”. In:Mathematische Annalen354.2 (2012), pp. 765–785

    2012

  9. [16]

    An algebraic characterization of groups with soluble word problem

    William W. Boone and Graham Higman. “An algebraic characterization of groups with soluble word problem”. In:J. Austral. Math. Soc.18 (1974), pp. 41–53

    1974

  10. [17]

    Obstructions for subgroups of Thompson’s groupV

    Jos´ e Burillo, Sean Cleary, and Claas E. R¨ over. “Obstructions for subgroups of Thompson’s groupV”. In:Geometric and Cohomological Group Theory. Ed. by Peter H. Kropholler, Ian J. Leary, Conchita Mart´ ınez-P´ erez, and Brita E. A. Nucinkis. London Mathematical Society Lectu...

    2017

  11. [18]

    Context-free pairs of groups I: Context- free pairs and graphs

    Tullio Ceccherini-Silberstein and Wolfgang Woess. “Context-free pairs of groups I: Context- free pairs and graphs”. In:European Journal of Combinatorics33.7 (2012), pp. 1449–1466

    2012

  12. [19]

    Elementary amenable groups

    Ching Chou. “Elementary amenable groups”. In:Illinois J. Math.24.3 (1980), pp. 396–407

    1980

  13. [20]

    Finiteness properties of Subgroups of Houghton Groups of full Hirsch length

    Charles Cox, Peter Kropholler, and Armando Martino. “Finiteness properties of Subgroups of Houghton Groups of full Hirsch length”. In:arXiv preprint arXiv:2508.07816(2025)

    2025 arXiv

  14. [21]

    Schreier graphs of the Basilica group

    Daniele D’Angeli, Alfredo Donno, Michel Matter, and Tatiana Nagnibeda. “Schreier graphs of the Basilica group.” In:Journal of Modern Dynamics4.1 (2010), pp. 167–205

    2010

  15. [23]

    Valentin Deaconu.Higman-Thompson groups from self-similar groupoid actions.https:// arxiv.org/abs/2108.01178. 2021

    2021 arXiv

  16. [24]

    Local Similarity Groups with Context-free Co-word Problem

    Daniel Farley. “Local Similarity Groups with Context-free Co-word Problem”. In:Topological Methods in Group Theory. London Mathematical Society Lecture Note Series. Cambridge University Press, 2018, pp. 67–91

    2018

  17. [25]

    On maximal subgroups of infinite index in branch and weakly branch groups

    Dominik Francoeur. “On maximal subgroups of infinite index in branch and weakly branch groups”. In:Journal of Algebra560 (2020), pp. 818–851

    2020

  18. [26]

    Normal subgroups of finitely generated branch groups are finitely gen- erated

    Dominik Francoeur. “Normal subgroups of finitely generated branch groups are finitely gen- erated”. In:J. Eur. Math. Soc. (JEMS)25.6 (2023). Appendix toCommensurated subgroups and micro-supported actionsby P.-E. Caprace and A. Le Boudec, pp. 2289–2292

    2023

  19. [27]

    Koji Fujiwara and Panos Papasoglu.A coarse-geometry characterization of cacti.https : //arxiv.org/abs/2305.08512. 2023. 42

    2023 arXiv

  20. [28]

    Graph minors and metric spaces

    Agelos Georgakopoulos and Panos Papasoglu. “Graph minors and metric spaces”. In:Com- binatorica45.3 (2025), p. 33

    2025

  21. [29]

    Schreier Graphs of Grigorchuk’s Group and a Subshift Associated to a Nonprimitive Substitution

    Rostislav Grigorchuk, Daniel Lenz, and Tatiana Nagnibeda. “Schreier Graphs of Grigorchuk’s Group and a Subshift Associated to a Nonprimitive Substitution”. In:Groups, Graphs and Random Walks. Ed. by Tullio Ceccherini-Silberstein, Maura Salvatori, and Ecaterina Sava- Huss. Lond...

    2017

  22. [30]

    Asymptotic aspects of Schreier graphs and Hanoi Towers groups

    Rostislav Grigorchuk and Zoran ˇSunik. “Asymptotic aspects of Schreier graphs and Hanoi Towers groups”. In:Comptes Rendus Mathematique342.8 (2006), pp. 545–550

    2006

  23. [31]

    Rostislav Grigorchuk and Yaroslav Vorobets.Thue-Morse sequence and groups of intermediate growth. 2026

    2026

  24. [32]

    On a torsion-free weakly branch group defined by a three state automaton

    Rostislav I. Grigorchuk and Andrzej ˙Zuk. “On a torsion-free weakly branch group defined by a three state automaton”. In:International Journal of Algebra and Computation12.01n02 (2002), pp. 223–246

    2002

  25. [33]

    On a subclass of context-free groups

    Thomas Herbst. “On a subclass of context-free groups”. In:RAIRO - Theoretical Informatics and Applications - Informatique Th´ eorique et Applications25.3 (1991), pp. 255–272

    1991

  26. [34]

    Subgroups of finitely presented groups

    Graham Higman. “Subgroups of finitely presented groups”. In:Proc. Roy. Soc. Ser. A262 (1961), pp. 455–475

    1961

  27. [35]

    Groups with context- free co-word problem

    Derek F. Holt, Sarah Rees, Claas E. R¨ over, and Richard M. Thomas. “Groups with context- free co-word problem”. In:J. London Math. Soc. (2)71.3 (2005), pp. 643–657

    2005

  28. [36]

    Local similarities and the Haagerup property (with an appendix by Daniel S. Farley)

    Bruce Hughes. “Local similarities and the Haagerup property (with an appendix by Daniel S. Farley)”. In:Groups, Geometry, and Dynamics3.2 (June 2009), pp. 299–315

    2009

  29. [37]

    James Hyde, Rachel Skipper, and Matthew C. B. Zaremsky.Action graphs, semiconjugacy, and non-embedding in Thompson’s groupV.https://arxiv.org/abs/2605.20564. 2026

    2026 arXiv

  30. [38]

    Thompson’s groupV

    Henry Jaspars.On context free subgroups and R. Thompson’s groupV. in preparation

  31. [39]

    Non-elementary amenable subgroups of automata groups

    Kate Juschenko. “Non-elementary amenable subgroups of automata groups”. In:Journal of Topology and Analysis10.01 (2018), pp. 35–45

    2018

  32. [40]

    On elementary amenable bounded automata groups

    Kate Juschenko, Benjamin Steinberg, and Phillip Wesolek. “On elementary amenable bounded automata groups”. In:Indiana Univ. Math. J.70 (6 2021), pp. 2479–2526

    2021

  33. [41]

    Tree approximation in quasi-trees

    Alice Kerr. “Tree approximation in quasi-trees”. In:Groups, Geometry, and Dynamics17.4 (2023), pp. 1193–1233

    2023

  34. [42]

    A commutator lemma for confined subgroups and applications to groups acting on rooted trees

    Adrien Le Boudec and Nicol´ as Matte Bon. “A commutator lemma for confined subgroups and applications to groups acting on rooted trees”. In:Transactions of the American Mathematical Society376.10 (2023), pp. 7187–7233

    2023

  35. [43]

    Gruppen von quasi-Automorphismen

    J¨ org Lehnert. “Gruppen von quasi-Automorphismen”. PhD thesis. Goethe Universit¨ at, 2008

    2008

  36. [44]

    The co-word problem for the Higman–Thompson group is context-free

    J¨ org Lehnert and Pascal Schweitzer. “The co-word problem for the Higman–Thompson group is context-free”. In:Bull. Lond. Math. Soc.39.2 (2007), pp. 235–241

    2007

  37. [45]

    Geometry of pseudocharacters

    Jason Fox Manning. “Geometry of pseudocharacters”. In:Geometry & Topology9 (2005), pp. 1147–1185

    2005

  38. [46]

    https://arxiv.org/abs/1801.10133

    Nicol´ as Matte Bon.Rigidity properties of full groups of pseudogroups over the Cantor set. https://arxiv.org/abs/1801.10133. 2018

    2018 arXiv

  39. [47]

    Topological full groups of one-sided shifts of finite type

    Hiroki Matui. “Topological full groups of one-sided shifts of finite type”. In:Journal f¨ ur die reine und angewandte Mathematik (Crelles Journal)2015.705 (2015), pp. 35–84

    2015

  40. [48]

    ´Etale groupoids arising from products of shifts of finite type

    Hiroki Matui. “ ´Etale groupoids arising from products of shifts of finite type”. In:Advances in Mathematics303 (2016), pp. 502–548

    2016

  41. [49]

    The theory of ends, pushdown automata, and second- order logic

    David E. Muller and Paul E. Schupp. “The theory of ends, pushdown automata, and second- order logic”. In:Theoretical Computer Science37 (1985), pp. 51–75

    1985

  42. [50]

    Free subgroups in groups acting on rooted trees

    Volodymyr Nekrashevych. “Free subgroups in groups acting on rooted trees”. In:Groups Geom. Dyn.4.4 (2010), pp. 847–862

    2010

  43. [51]

    https://arxiv.org/abs/2412.04138

    Davide Perego and Matteo Tarocchi.Eventually Self-Similar Groups acting on Fractals. https://arxiv.org/abs/2412.04138. 2024. 43

    2024 arXiv

  44. [52]

    Generalizations of the Muller–Schupp theorem and tree-like inverse graphs

    Emanuele Rodaro. “Generalizations of the Muller–Schupp theorem and tree-like inverse graphs”. In:Journal of the London Mathematical Society109.5 (2024), e12903

    2024

  45. [53]

    Constructing Finitely Presented Simple Groups That Contain Grigorchuk Groups

    Claas E. R¨ over. “Constructing Finitely Presented Simple Groups That Contain Grigorchuk Groups”. In:Journal of Algebra220.1 (1999), pp. 284–313

    1999

  46. [54]

    Finite automata of polynomial growth do not generate a free group

    Said Sidki. “Finite automata of polynomial growth do not generate a free group”. In:Geom. Dedicata108 (2004), pp. 193–204

    2004

  47. [55]

    Michael Sipser.Introduction to the Theory of Computation. Third. Boston, MA: Course Tech- nology, 2013

    2013

  48. [56]

    On a generalization of the Hanoi Towers Group

    Rachel Skipper. “On a generalization of the Hanoi Towers Group”. PhD thesis. State Univer- sity of New York at Binghamton, 2018

    2018

  49. [57]

    Rearrangement Groups of Fractals: Structure and Conjugacy

    Matteo Tarocchi. “Rearrangement Groups of Fractals: Structure and Conjugacy”. PhD thesis. University of Pavia, 2024

    2024

  50. [58]

    Growth functions of some classes of languages

    Vladimir I. Trofimov. “Growth functions of some classes of languages”. In:Cybernetics17 (1981), pp. 727–731

    1981

  51. [59]

    Thompson groups for systems of groups, and their finiteness properties

    Stefan Witzel and Matthew C.B. Zaremsky. “Thompson groups for systems of groups, and their finiteness properties”. In:Groups, Geometry, and Dynamics12.1 (2018), pp. 289–358

    2018

  52. [60]

    A user’s guide to cloning systems

    Matthew C.B. Zaremsky. “A user’s guide to cloning systems”. In:Topology Proceedings52 (2018), pp. 13–33

    2018

  53. [61]

    Zaremsky.Some open problems.https : / / zaremsky

    Matthew C.B. Zaremsky.Some open problems.https : / / zaremsky . github . io / open _ problems.pdf. 44

Pith tools

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