SearcharxivSearch

arXiv subjects

Jan Moritz Petschick

Publications and source records attributed to Jan Moritz Petschick.

9 recordsLinked to original sources

Conciseness of first-order formulae

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to first-order formulae in the language of groups. We consider this more general setting and establish conciseness for various classes of groups and formulae. We prove that all formulae are concise in the class of abelian groups and that every existential formula is concise in the class of torsion-free locally class-2 nilpotent groups. In addition, we construct new examples of weakly rational words, which allow us to produce a wide variety of formulae that are concise in the class of residually finite groups.

math.GR

On finitely generated Engel branch groups

We construct finitely generated Engel branch groups, answering a question of Fernández-Alcober, Noce and Tracey on the existence of such objects. In particular, the groups constructed are not nilpotent, yielding the second known class of examples of finitely generated non-nilpotent Engel groups following a construction by Golod from 1969. To do so, we exhibit groups acting on rooted trees with growing valency on which word lengths of elements are contracting very quickly under section maps. Our methods apply in principle to a wider class of iterated identities, of which the Engel words are only a special case.

math.GR

Free polynilpotent groups and the Magnus property

Motivated by a classic result for free groups, one says that a group $G$ has the Magnus property if the following holds: whenever two elements generate the same normal subgroup of $G$, they are conjugate or inverse-conjugate in $G$. It is a natural problem to find out which relatively free groups display the Magnus property. We prove that a free polynilpotent group of any given class row has the Magnus property if and only if it is nilpotent of class at most $2$. For this purpose we explore the Magnus property more generally in soluble groups, and we produce new techniques, both for establishing and for disproving the property. We also prove that a free centre-by-(polynilpotent of given class row) group has the Magnus property if and only if it is nilpotent of class at most $2$. On the way, we display $2$-generated nilpotent groups (with non-trivial torsion) of any prescribed nilpotency class with the Magnus property. Similar examples of finitely generated, torsion-free nilpotent groups are hard to come by, but we construct a $4$-generated, torsion-free, class-$3$ nilpotent group of Hirsch length $9$ with the Magnus property. Furthermore, using a weak variant of the Magnus property and an ultraproduct construction, we establish the existence of metabelian, torsion-free, nilpotent groups of any prescribed nilpotency class with the Magnus property.

math.GR

The automorphism group of a multi-GGS group

A multi-GGS-group is a group of automorphisms of a regular rooted tree, generalising the Gupta--Sidki $p$-groups. We compute the automorphism groups of all non-constant multi-GGS-groups.

math.GR

The derived series of GGS-groups

Given a GGS-group $G$ with non-constant defining tuple over a prime-regular rooted tree, we calculate the indices $|G:G^{(n)}|$ and describe the structure of the higher derived subgroups $G^{(n)}$ for all $n \in \mathbb{N}$. We find that the values $|G:G^{(n)}|$ depend only mildly on the structure of the defining tuple.

math.GR

Conjugacy classes of polyspinal groups

Spinal groups and multi-GGS groups are both generalisations of the well-known Grigorchuk-Gupta-Sidki (GGS-)groups. Here we give a necessary condition for spinal groups to be conjugate, and we establish a necessary and sufficient condition for multi-GGS groups to be conjugate. We also introduce a natural common generalisation of both classes, which we call polyspinal groups. Our results enable us to give a negative answer to a question of Bartholdi, Grigorchuk and Sunik, on whether every finitely generated branch group is isomorphic to a weakly branch spinal group.

math.GR

Groups of small period growth

We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups and is connected to an approximative version of the restricted Burnside problem.

math.GR

Two periodicity conditions for spinal groups

A constant spinal group is a subgroup of the automorphism group of a regular rooted tree, generated by a group of rooted automorphisms $A$ and a group of directed automorphisms $B$ whose action on a subtree is equal to the global action. We provide two conditions in terms of certain dynamical systems determined by $A$ and $B$ for constant spinal groups to be periodic, generalising previous results on Grigorchuk--Gupta--Sidki groups and other related constructions. This allows us to provide various new examples of finitely generated infinite periodic groups.

math.GR

On the Basilica Operation

Inspired by the Basilica group $\mathcal B$, we describe a general construction which allows us to associate to any group of automorphisms $G \leq \operatorname{Aut}(T)$ of a rooted tree $T$ a family of Basilica groups $\operatorname{Bas}_s(G), s \in \mathbb{N}_+$. For the dyadic odometer $\mathcal{O}_2$, one has $\mathcal B = \operatorname{Bas}_2(\mathcal{O}_2)$. We study which properties of groups acting on rooted trees are preserved under this operation. Introducing some techniques for handling $\operatorname{Bas}_s(G)$, in case $G$ fulfills some branching conditions, we are able to calculate the Hausdorff dimension of the Basilica groups associated to certain $\mathsf{GGS}$-groups and of generalisations of the odometer, $\mathcal{O}_m^d$. Furthermore, we study the structure of groups of type $\operatorname{Bas}_s(\mathcal{O}_m^d)$ and prove an analogue of the congruence subgroup property in the case $m = p$, a prime.

math.GR