Related papers: To Infinity and Beyond
We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…
We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…
Let Mod(S) denote the mapping class group of a compact, orientable surface S. We prove that finitely generated subgroups of Mod(S) which are not virtually abelian have uniform exponential growth with minimal growth rate bounded below by a…
We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…
We show that the minimal number of generators and the Cohen-Macaulay type of a family of numerical semigroups generated by concatenation of arithmetic sequences is unbounded.
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…
We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite non-monotonic growth functions of…
We show that an infinite finitely generated group G is virtually-Z if and only if every Cayley graph of G contains only finitely many Busemann points in its horofunction boundary. This complements a previous result of the second named…
We show that an accessible group with infinitely many ends has property $R_{\infty}$. That is, it has infinitely many twisted conjugacy classes for any twisting automorphism. We deduce that having property $R_{\infty}$ is undecidable…
We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber…
We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…
A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
In the first part, we prove that the dominion (in the sense of Isbell) of a subgroup of a finitely generated nilpotent group is trivial in the category of all nilpotent groups. In the second part, we show that the dominion of a subgroup of…
We extend work of the first author and Khoussainov to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic…
We provide a class of non-contracting groups containing an infinite family of fractal and weakly regular branch groups, and study certain properties including abelianization, just infiniteness, and word problem. We present an example of a…
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…
I prove that the generic type of the free nonabelian group has infinite weight (strengthening non superstability of the free group).