pith. sign in

arxiv: 2111.15206 · v1 · submitted 2021-11-30 · 🧮 math.GR · math.PR

Amenability of quadratic automaton groups

Gideon Amir , Omer Angel , Balint Virag This is my paper

Pith reviewed 2026-05-24 12:17 UTC · model grok-4.3

classification 🧮 math.GR math.PR
keywords amenabilityautomaton groupsSchreier graphselectrical resistanceNash-Williams criterionmother groupsgroup actions on trees
0
0 comments X

The pith

Every quadratic activity automaton group is amenable.

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

The paper aims to establish that every quadratic activity automaton group is amenable. It does so by proving lower bounds on electrical resistance between vertices in the Schreier graphs that arise from the actions of linear and quadratic mother groups on the orbit of the zero ray. These bounds rest on a new weighted version of the Nash-Williams criterion. If the bounds hold, the groups satisfy the definition of amenability via existing criteria. A reader would care because amenability distinguishes groups that support invariant averaging from those that contain free subgroups on two generators.

Core claim

The authors derive lower bounds for electrical resistance between vertices in the Schreier graphs of the linear and quadratic mother groups acting on the orbit of the zero ray. Combined with earlier results, these bounds establish that every quadratic activity automaton group is amenable. The bounds are obtained through an apparently new weighted version of the Nash-Williams criterion.

What carries the argument

The weighted Nash-Williams criterion applied to Schreier graphs of mother groups, which produces the resistance lower bounds needed for amenability.

If this is right

  • Every quadratic activity automaton group is amenable.
  • The resistance lower bounds hold for both the linear and quadratic mother groups.
  • The weighted Nash-Williams criterion yields usable lower bounds on these infinite Schreier graphs.

Where Pith is reading between the lines

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

  • The weighted Nash-Williams criterion may apply to resistance estimates on other families of infinite regular graphs.
  • The same resistance technique could be tested on automaton groups with activity degree higher than two.

Load-bearing premise

That prior results apply directly to the Schreier graphs of quadratic mother groups once the resistance lower bounds are established.

What would settle it

A calculation showing that resistance between two vertices in one of the relevant Schreier graphs falls below the stated lower bound would falsify the resistance estimates and thereby the amenability conclusion.

Figures

Figures reproduced from arXiv: 2111.15206 by Balint Virag, Gideon Amir, Omer Angel.

Figure 1
Figure 1. Figure 1: Top and middle rows: The graphs Gd,2,n for d = 1 and n = 1, 2, 3, 4. Bottom row: The graph G1,3,2 and its quotient G1,2,2 with multiple edges and self loops. Edge colour denotes its type: Black for t = −1, red for t = 0 and blue for t = 1. The bold loop on the bottom right has multiplicity 4, not all of the same type, but of course has no effect on resistances. Vertices are laid out according to the linear… view at source ↗
Figure 2
Figure 2. Figure 2: Examples for Lemma 4.1. Left: (x, y) is a type 1 edge. Both begin with a common prefix w, and differ only in position k, with a one immediately afterwards. If w has an even number of ones then x < b yb, otherwise it would be reversed. If (x, y) ∈ Sa then x <b ba ≤ yb, and so ba must take one of two forms, depending on its kth digit. The ∗’s indicate digits that could take any value in {0, 1}. However, in t… view at source ↗
read the original abstract

We give lower bounds for the electrical resistance between vertices in the Schreier graphs of the action of the linear (degree 1) and quadratic (degree 2) mother groups on the orbit of the zero ray. These bounds, combined with results of \cite{JNS} show that every quadratic activity automaton group is amenable. The resistance bounds use an apparently new "weighted" version of the Nash-Williams criterion which may be of independent interest.

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 / 1 minor

Summary. The manuscript establishes lower bounds on electrical resistance between vertices in the Schreier graphs of the linear and quadratic mother groups acting on the orbit of the zero ray. These bounds are derived using a new weighted version of the Nash-Williams criterion and, when combined with results from JNS, are used to conclude that every quadratic activity automaton group is amenable.

Significance. If the resistance bounds hold and the JNS theorem applies without additional restrictions, the result would establish amenability for an entire class of automaton groups, which is a substantial contribution to geometric group theory. The weighted Nash-Williams criterion is presented as potentially of independent interest.

major comments (1)
  1. [The section applying JNS results (following the resistance bounds)] The load-bearing step is the claim that the established resistance lower bounds suffice for the JNS hypotheses to hold on the Schreier graphs of the zero-ray orbit. The manuscript does not supply an explicit verification or condition check that the JNS theorem applies directly to these graphs beyond the resistance estimates themselves; this verification is required to support the amenability conclusion.
minor comments (1)
  1. [Abstract] The abstract refers to an 'apparently new' weighted Nash-Williams criterion; a brief comparison to the standard Nash-Williams criterion would clarify the novelty.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for identifying the need to make the application of the JNS theorem fully explicit. We address the major comment below and will revise the manuscript to strengthen this part of the argument.

read point-by-point responses

  1. Referee: [The section applying JNS results (following the resistance bounds)] The load-bearing step is the claim that the established resistance lower bounds suffice for the JNS hypotheses to hold on the Schreier graphs of the zero-ray orbit. The manuscript does not supply an explicit verification or condition check that the JNS theorem applies directly to these graphs beyond the resistance estimates themselves; this verification is required to support the amenability conclusion.

    Authors: We agree that an explicit verification strengthens the presentation. In the revised manuscript we will add a short dedicated paragraph (immediately after the resistance bounds are established) that checks the hypotheses of the JNS theorem against the Schreier graphs of the zero-ray orbit and the resistance lower bounds we obtain. This will make transparent how the new weighted Nash-Williams estimates imply the required conditions for amenability via JNS, without altering the logical structure of the proof. revision: yes

Circularity Check

0 steps flagged

No significant circularity; amenability derived from novel resistance bounds plus external JNS theorem

full rationale

The paper derives lower bounds on electrical resistance for specific Schreier graphs using a newly introduced weighted Nash-Williams criterion, then combines these bounds with the external JNS result to conclude amenability of quadratic activity automaton groups. No step reduces by construction to a fitted input, self-definition, or self-citation chain; the weighted criterion is presented as original, the resistance estimates are computed directly from the graphs, and JNS is an independent external citation whose hypotheses are claimed to be satisfied by the new bounds. This matches the default expectation of a non-circular paper relying on external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the work relies on standard electrical-network theory and the external JNS theorem.

axioms (1)
  • standard math Standard results of electrical network theory on infinite graphs apply to the Schreier graphs under consideration.
    Invoked to translate resistance bounds into amenability via JNS.

pith-pipeline@v0.9.0 · 5586 in / 1101 out tokens · 24203 ms · 2026-05-24T12:17:11.041996+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

16 extracted references · 16 canonical work pages

  1. [1]

    On the joint behaviour of speed and entropy of random walks on groups

    Gideon Amir. On the joint behaviour of speed and entropy of random walks on groups. Groups, Geometry, and Dynamics , 11(2):455–467, 2017

    work page 2017

  2. [2]

    The liouville property for groups acting on rooted trees

    Gideon Amir, Omer Angel, Nicol´ as Matte Bon, and B´ alint Vir´ ag. The liouville property for groups acting on rooted trees. In Annales de l’Institut Henri Poincar´ e, Probabilit´ es et Statistiques, volume 52, pages 1763–1783. Institut Henri Poincar´ e, 2016

    work page 2016

  3. [3]

    Amenability of linear- activity automaton groups

    Gideon Amir, Omer Angel, and B´ alint Vir´ ag. Amenability of linear- activity automaton groups. Journal of the European Mathematical So- ciety, 15(3):705–730, 2013

    work page 2013

  4. [4]

    Speed exponents of random walks on groups

    Gideon Amir and B´ alint Vir´ ag. Speed exponents of random walks on groups. International Mathematics Research Notices , 2017(9):2567– 2598, 2017

    work page 2017

  5. [5]

    On amenability of automata groups

    Laurent Bartholdi, Vadim A Kaimanovich, and Volodymyr V Nekra- shevych. On amenability of automata groups. Duke Mathematical Jour- nal, 154(3):575–598, 2010. 18

    work page 2010

  6. [6]

    Amenability and non-uniform growth of some di- rected automorphism groups of a rooted tree.Mathematische Zeitschrift, 263(2):265, 2009

    J´ er´ emie Brieussel. Amenability and non-uniform growth of some di- rected automorphism groups of a rooted tree.Mathematische Zeitschrift, 263(2):265, 2009

    work page 2009

  7. [7]

    Behaviors of entropy on finitely generated groups

    J´ er´ emie Brieussel. Behaviors of entropy on finitely generated groups. The Annals of Probability , 41(6):4116–4161, 2013

    work page 2013

  8. [8]

    Random walks and electric networks , volume 22

    Peter G Doyle and J Laurie Snell. Random walks and electric networks , volume 22. American Mathematical Soc., 1984

    work page 1984

  9. [9]

    Automata and square complexes

    Yair Glasner and Shahar Mozes. Automata and square complexes. Ge- ometriae Dedicata, 111(1):43–64, 2005

    work page 2005

  10. [10]

    Ex- tensions of amenable groups by recurrent groupoids

    Kate Juschenko, Volodymyr Nekrashevych, and Mikael De La Salle. Ex- tensions of amenable groups by recurrent groupoids. Inventiones math- ematicae, 206(3):837–867, 2016

    work page 2016

  11. [11]

    Random walks on discrete groups: boundary and entropy

    Vadim A Kaimanovich and Anatoly M Vershik. Random walks on discrete groups: boundary and entropy. The annals of probability , 11(3):457–490, 1983

    work page 1983

  12. [12]

    Probability on trees and networks , vol- ume 42

    Russell Lyons and Yuval Peres. Probability on trees and networks , vol- ume 42. Cambridge University Press, 2017

    work page 2017

  13. [13]

    Self-similar groups

    Volodymyr Nekrashevych. Self-similar groups. Number 117. American Mathematical Soc., 2005

    work page 2005

  14. [14]

    Automorphisms of one-rooted trees: growth, circuit struc- ture, and acyclicity

    Said Sidki. Automorphisms of one-rooted trees: growth, circuit struc- ture, and acyclicity. Journal of Mathematical Sciences , 100(1):1925– 1943, 2000

    work page 1925

  15. [15]

    Finite automata of polynomial growth do not generate a free group

    Said Sidki. Finite automata of polynomial growth do not generate a free group. Geometriae Dedicata, 108(1):193–204, 2004

    work page 2004

  16. [16]

    On a free group of transforma- tions defined by an automaton

    Mariya Vorobets and Yaroslav Vorobets. On a free group of transforma- tions defined by an automaton. Geometriae Dedicata, 1(124):237–249, 2007. 19

    work page 2007