Related papers: To Infinity and Beyond

We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…

We show that every non-trivial ordered abelian group $G$ is augmentable by infinite elements, i.e., we have $G\preccurlyeq H\oplus G$ for some non-trivial ordered abelian group $H$. As an application, we show that when $k$ is a field of…

We show that if a group G is finitely presented and nilpotent-by-abelian-by-finite, then there is an upper bound on the first betti number of M as M runs through all subgroups of finite index in G.

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…

The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.

The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

We construct a finitely generated group which is an extension of two finitely generated groups coarsely embeddable into Hilbert space but which itself does not coarsely embed into Hilbert space. Our construction also provides a new infinite…

We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…

We announce the folowing result: Any finitely generated non virtually solvable linear group over a field of characteristic zero has uniform exponential growth.

We provide the first example of virtually nilpotent group, with a specific generating set, for which the Green series (sometimes called cogrowth series) is not $D$-finite. The proof relies on an arithmetical miracle, and the study of the…

We prove that every non-abelian finite simple group is generated by an involution and an element of prime order.

In this paper we determine all finitely generated abelian groups which are varietal capable with respect to the variety of polynilpotent groups. This result is a vast generalization of the famous Baer's result about capability of finitely…

We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all…

A finitely generated solvable group with unbounded iterated identity is constructed.

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

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…