Related papers: Connected reversible Mealy automata of prime size …
We exhibit infinite, solvable, virtually abelian groups with a fixed number of generators, having arbitrarily large balls consisting of torsion elements. We also provide a sequence of 3-generator non-virtually nilpotent polycyclic groups of…
In "On the asymptotics of the growth of 2-step nilpotent groups" (J. London Math. Soc. (2), 58 (1998)), we remarked that, contrary to 2-step nilpotent simply connected Lie groups, in 3-step nilpotent simply connected Lie groups it is…
To the best of our knowledge, there is no explicit, constructive description of the generating set for the unit group $A(G)^\times$ of the Burnside ring associated with a finite group $G$. We resolve this long-standing open question,…
The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…
We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a…
We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…
We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…
A finitely generated solvable group with unbounded iterated identity is constructed.
We construct first examples of infinite finitely generated residually finite torsion groups with positive rank gradient. In particular, these groups are non-amenable. Some applications to problems about cost and $L^2$-Betti numbers are…
We show that there exist non-unitarizable groups without non-abelian free subgroups. Both torsion and torsion free examples are constructed. As a by-product, we show that there exist finitely generated torsion groups with non-vanishing…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
We provide new examples of groups without rational cross-sections (also called regular normal forms), using connections with bounded generation and rational orders on groups. Specifically, our examples are extensions of infinite torsion…
Julius Whiston calculated the maximum size of an irredundant generating set for $S_n$ and $A_n$ by examination of maximal subgroups. Using analogous considerations, we will compute upper bounds to this value for the first two Mathieu…
There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation,…
Using quantum representations of mapping class groups we prove that profinite completions of Burnside-type surface group quotients are not virtually prosolvable, in general. Further, we construct infinitely many finite simple characteristic…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
We show that every finitely generated residually finite torsion group $G$ embeds in a finitely generated torsion group $\Gamma$ that is residually finite simple. In particular we show the existence of finitely generated infinite torsion…
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…
Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…