Related papers: Amenability of Bounded Automata Groups on Infinite…

We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem of finding examples of infinite…

By combining R{\o}rdam's construction and the author's previous construction, we provide the first examples of amenable actions of non-amenable groups on simple separable nuclear C*-algebras that are neither stably finite nor purely…

We are interested in the subgroup membership problem in groups acting on rooted $d$-regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…

Let D denote an infinite alphabet -- a set that consists of infinitely many symbols. A word w = a_0 b_0 a_1 b_1 ... a_n b_n of even length over D can be viewed as a directed graph G_w whose vertices are the symbols that appear in w, and the…

We prove that, if a discrete group $G$ is not inner amenable, then the unit group of the ring of operators affiliated with the group von Neumann algebra of $G$ is non-amenable with respect to the topology generated by its rank metric. This…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…

We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

We study fluctuations of ergodic averages generated by actions of amenable groups. In the setting of an abstract ergodic theorem for locally compact second countable amenable groups acting on uniformly convex Banach spaces, we deduce a…

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

In this paper, we study some large scale properties of the mother groups of bounded automata groups. First we give two methods to prove every mother group has infinite asymptotic dimension. Then we study the decomposition complexity of…

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…

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…

We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non…