Related papers: On elementary amenable bounded automata groups
We show that every bounded automaton group can be embedded in a finitely generated, simple amenable group. The proof is based on the study of the topological full groups associated to the Schreier dynamical system of the mother groups. We…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acts absolutely non-freely on the boundary of the…
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 give a complete and irredundant list of the finite groups $G$ for which Aut$(G)$, acting naturally on $G$, has precisely $3$ orbits. There are 7 infinite families: one abelian, one non-nilpotent, three families of non-abelian $2$-groups…
The Basilica group is a well-known 2-generated weakly branch, but not branch, group acting on the binary rooted tree. Recently a more general form of the Basilica group has been investigated by Petschick and Rajeev, which is an…
We prove that the tree almost automorphism groups admit exactly three commensurability classes of closed commensurated subgroups. Our proof utilizes an independently interesting characterization of subgroups of the tree almost automorphism…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…
We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…
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…
We continue the investigation of notions of approximate amenability that were introduced in work of the second and third authors. It is shown that every boundedly approximately contractible Banach algebra has a bounded approximate identity.…
Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…
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…
We characterize left and right amenable semigroups of polynomials of one complex variable with respect to the composition operation. We also prove a number of results about amenable semigroups of arbitrary rational functions. In particular,…
We describe elementary examples of finitely presented sofic groups which are not residually amenable (and thus not initially subamenable or LEA, for short). We ask if an amalgam of two amenable groups over a finite subgroup is residually…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
We provide an example of two elementarily equivalent countable ICC groups $G$ and $H$ such that $G$ is amenable and $H$ is not inner amenable. As a result, we provide the first example of elementarily equivalent groups whose group von…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
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…