English
Related papers

Related papers: On amenability of automata groups

200 papers

There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation,…

Group Theory · Mathematics 2018-01-09 Kate Juschenko , Benjamin Steinberg , Phillip Wesolek

We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group -- the mother group -- has asymptotic entropy 0.…

Group Theory · Mathematics 2013-07-24 Gideon Amir , Omer Angel , Balint Virag

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

Group Theory · Mathematics 2023-04-10 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno , Emanuele Rodaro

We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This covers amenability of a wide class groups, the amenability of which…

Group Theory · Mathematics 2017-10-05 Kate Juschenko , Volodymyr Nekrashevych , Mikael de la Salle

We consider groups of automorphisms of locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. This covers all known examples of groups that are not elementary amenable and act on the…

Group Theory · Mathematics 2015-04-03 Kate Juschenko

We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…

Group Theory · Mathematics 2020-04-13 Bernhard Reinke

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation…

Group Theory · Mathematics 2007-05-23 Laurent Bartholdi

We answer an open question of Grigorchuk and Zuk about amenability using random walks. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct…

Group Theory · Mathematics 2011-11-10 Laurent Bartholdi , Balint Virag

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Group Theory · Mathematics 2023-12-07 Tobias Hartnick , Merlin Incerti-Medici

We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…

Group Theory · Mathematics 2013-08-13 Rostislav Grigorchuk , Dmytro Savchuk

We prove that the action of the automorphism group of a building on its boundary is topologically amenable. The notion of boundary we use was defined in a previous paper \cite{CL}. It follows from this result that such groups have property…

Group Theory · Mathematics 2009-07-14 Jean Lecureux

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

Combinatorics · Mathematics 2017-12-29 Micheal Pawliuk , Miodrag Sokic

We prove a converse to Myhill's "Garden-of-Eden" theorem and obtain in this manner a characterization of amenability in terms of cellular automata: "A group $G$ is amenable if and only if every cellular automaton with carrier $G$ that has…

Formal Languages and Automata Theory · Computer Science 2016-06-09 Laurent Bartholdi , Dawid Kielak

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that…

Combinatorics · Mathematics 2009-12-17 Laurent Bartholdi

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…

Logic · Mathematics 2014-02-17 François G. Dorais , Steven Gubkin , Daniel McDonald , Manuel Rivera

We study under which condition an amalgamated free product or an HNN-extension over a finite subgroup admits an amenable, transitive and faithful action on an infinite countable set. We show that such an action exists if the initial groups…

Group Theory · Mathematics 2012-09-21 Pierre Fima

Moore characterized the amenability of automorphism groups of countable ultrahomogeneous structures by a Ramsey-type property. We extend this result to automorphism groups of metric Fra\"iss\'e structures, which encompass all Polish groups.…

Logic · Mathematics 2013-09-06 Adriane Kaïchouh

Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…

Logic · Mathematics 2007-05-23 Alexander Berenstein

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Group Theory · Mathematics 2020-07-23 Nicolas Radu

An explicit family of Folner sets is constructed for some directed groups acting on a rooted tree of sublogarithmic valency by alternate permutations. In the case of bounded valency, these groups were known to be amenable by probabilistic…

Group Theory · Mathematics 2013-09-09 Jeremie Brieussel
‹ Prev 1 2 3 10 Next ›