Related papers: Large scale properties for bounded automata groups

Even though big mapping class groups are not countably generated, certain big mapping class groups can be generated by a coarsely bounded set and have a well defined quasi-isometry type. We show that the big mapping class group of a stable…

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

We examine asymptotic dimension and property A for groups acting on complexes. In particular, we prove that the fundamental group of a finite, developable complex of groups will have finite asymptotic dimension provided the geometric…

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.

We show for a free action of a countable group $\Gamma$ on a finite-dimensional, compact metric space by homeomorphisms that the dynamic asymptotic dimension is either infinite or coincides with the asymptotic dimension of $\Gamma$.

It is shown that certain diffeomorphism or homeomorphism groups with no restriction on support of an open manifold with finite number of ends are bounded. It follows that these groups are uniformly perfect. In order to characterize the…

By recognizing them as fundamental groups of developable complexes of groups we prove that mapping class groups of compact orientable surfaces have finite asymptotic dimension.

Mother groups are the basic building blocks for polynomial automaton groups. We show that, in contrast with mother groups of degree 0 or 1, any bounded, symmetric, generating random walk on the mother groups of degree at least 3 has…

In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint…

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 study contraction groups for automorphisms of totally disconnected locally compcat groups using the scale of the automorphism as a tool. The contraction group is shown to be unbounded when the inverse automorphism has non-trivial scale…

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…

Let G be a finitely presented group, and G' its commutator subgroup. Let C be the Cayley graph of G' with all commutators in G as generators. Then C is large scale simply connected. Furthermore, if G is a torsion-free nonelementary…

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…

We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

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…

We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.

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…

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…