English
Related papers

Related papers: On amenability of automata groups

200 papers

Beyond the locally compact case, equivalent notions of amenability diverge, and some properties no longer hold, for instance amenability is not inherited by topological subgroups. This investigation is guided by some amenability-type…

Group Theory · Mathematics 2025-03-05 Vladimir G. Pestov , Friedrich Martin Schneider

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

Group Theory · Mathematics 2023-04-11 Victor Guba

Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well.…

Dynamical Systems · Mathematics 2018-09-10 Russell Lyons

We describe conditions that characterize amenability for groups in terms of positive definite functions valued in a von Neumann algebra.

Operator Algebras · Mathematics 2022-02-02 Mikaël Pichot , Erik Séguin

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

Group Theory · Mathematics 2018-05-25 Gareth A. Jones

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

Group Theory · Mathematics 2015-06-02 Mark Brittenham , Susan Hermiller , Ashley Johnson

We prove that on a metrizable, compact, zero-dimensional space every free action of an amenable group is measurably isomorphic to a minimal $G$-action with the same, i.e. affinely homeomorphic, simplex of measures.

Dynamical Systems · Mathematics 2014-06-23 Bartosz Frej , Dawid Huczek

We introduce two families of examples of groups acting on trees, one consisting of group amalgamations and the other consisting of HNN-extensions, motivated by the problems of $C^*$-simplicity and unique trace property. Moreover, we prove…

Operator Algebras · Mathematics 2020-03-24 Nikolay A. Ivanov

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

Group Theory · Mathematics 2007-05-23 Robert Gilman Michael Shapiro

We prove that the amalgamated free product of two free groups of rank two over a common cyclic subgroup, admits an amenable, faithful, transitive action on an infinite countable set. We also show that any finite index subgroup admits such…

Group Theory · Mathematics 2010-03-23 Soyoung Moon

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Said N. Sidki

This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble…

Group Theory · Mathematics 2011-02-16 Miklos Abert , Andrei Jaikin-Zapirain , Nikolay Nikolov

We completely characterize connected Lie groups all of whose countable subgroups are weakly amenable. We also provide a characterization of connected semisimple Lie groups that are weakly amenable. Finally, we show that a connected Lie…

Functional Analysis · Mathematics 2018-10-17 Søren Knudby

We give a classification of iwip outer automorphisms of the free group, by discussing the properties of their attracting and repelling trees.

Group Theory · Mathematics 2012-08-13 Thierry Coulbois , Arnaud Hilion

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kartzow

Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…

Formal Languages and Automata Theory · Computer Science 2025-10-17 Niccolo' Castronuovo , Alberto Dennunzio , Luciano Margara

We give an upper bound for the number of ``overlattices'' in the automorphism group of a tree, containing a fixed lattice with index n. For an example of a lattice in the automorphism group of a 2p-regular tree whose quotient is a loop, we…

Group Theory · Mathematics 2007-05-23 Seonhee Lim

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

Group Theory · Mathematics 2022-05-16 Karol Duda

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

Averaging linear functional on the space continuous functions of the group of diffeomorphisms of interval is found. Amenability of several discrete subgroups of the group of diffeomorphisms $\Diff^3([0,1])$ of interval is prove. In…

Group Theory · Mathematics 2011-01-17 E. T. Shavgulidze