Quadratic activity automaton groups are amenable, proved by resistance lower bounds in their Schreier graphs via a new weighted Nash-Williams criterion.
Automata and square complexes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Amenability of quadratic automaton groups
Quadratic activity automaton groups are amenable, proved by resistance lower bounds in their Schreier graphs via a new weighted Nash-Williams criterion.