Related papers: Free-by-cyclic groups are equationally Noetherian

Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a…

A first-order theory is Noetherian with respect to the collection of formulae $\mathcal{F}$ if every definable set is a Boolean combination of instances of formulae in $\mathcal{F}$ and the topology whose subbasis of closed sets is the…

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

We study the automorphisms \phi of a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of \phi that behaves very much like the…

It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

We show that every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has linear growth. This implies that the the corresponding semigroup algebra is a PI algebra.

A finite group $G$ is a called a DCI-group if any two isomorphic Cayley digraphs of $G$ are also isomorphic via an automorphism of $G$. If $G$ is a non-abelian generalised dihedral DCI-group, then Dobson, Muzychuk, and Spiga proved that $G$…

We construct examples of free-by-cyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2-cell to a non-positively curved, squared 2-complex defined by labeled oriented…

Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an…

Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has…

We develop a notion of groups that act acylindrically and non-elementarily on simplicial trees, which we call acylindrically arboreal groups. We then prove a complete classification of when graph products of groups and the fundamental…

Let $B$ be a Noetherian normal local ring, and $G\subset\Aut(B)$ a cyclic group of local automorphisms of prime order. Let $A$ be the ring of $G$-invariants of $B$, assume that $A$ is Noetherian. We study the invariant morphism; in…

Denote by $G$ a finite group and let $\psi(G)$ denote the sum of element orders in $G$. In 2009, H.Amiri, S.M.Jafarian Amiri and I.M.Isaacs proved that if $|G|=n$ and $G$ is non-cyclic, then $\psi(G)<\psi(C_n)$, where $C_n$ denotes the…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…