Related papers: On amenability of automata groups

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

In this paper we prove that the automorphism groups of certain countable generic structures are not amenable. For doing that, we first prove the existence of particular matrices that do not satisfy the convex Ramsey condition. For a pair of…

We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We discuss relations between the amenability of a graph and spectral properties of a random walk driven by a dynamical system. In order to include graphs which are not locally compact, we introduce the concept of amenability of weighted…

Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…

We show that every normal amenable subgroup of the automorphism group of the full shift is contained in its center. This follows from the analysis of this group's Furstenberg topological boundary, through the construction of a minimal and…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

In this paper we study analogues of amenability for topological groups in the context of definable structures. We prove fixed point theorems for such groups. More importantly, we propose definitions for definable actions and continuous…

We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a certain quantity…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

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

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…