Related papers: On elementary amenable bounded automata groups
In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.
Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…
We show that every free continuous action of a countably infinite elementary amenable group on a finite-dimensional compact metrizable space is almost finite. As a consequence, the crossed products of minimal such actions are…
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…
The subgroup structure of Thompson's group F is not yet fully understood. The group F is a subgroup of the group PL(I) of orientation preserving, piecewise linear self homeomorphisms of the unit interval and this larger group thus also has…
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…
It is well-known that a Kleinian group is amenable if and only if it is elementary. We establish an analogous property for equivalence relations and foliations with Gromov hyperbolic leaves: they are amenable if and only if they are…
Consider unbounded reduced Abelian p-groups (p > 2) A and A'. In this paper, we prove that if the automorphism groups Aut A and Aut A' are elementary equivalent then the groups A and A' are equivalent in the second order logic bounded by…
We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.
A group is boundedly acyclic if its bounded cohomology with trivial real coefficients vanishes in all positive degrees. Amenable groups are boundedly acyclic, while the first non-amenable examples were the group of compactly supported…
Associated to an abelian variety over a number field are several interesting and related groups: the motivic Galois group, the Mumford-Tate group, $\ell$-adic monodromy groups, and the Sato-Tate group. Assuming the Mumford-Tate conjecture,…
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…
Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…
In this short note we study the entropy for algebraic actions of certain amenable groups. The possible values for this entropy are studied. Various fundamental results about certain classes of amenable groups are reproved using elementary…
We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…
Motivated by a problem in complex dynamics, we examine the block structure of the natural action of monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…