Searcharxiv⌕ Search

arXiv subjects

Maurice Chiodo

Publications and source records attributed to Maurice Chiodo.

27 records · Page 2Linked to original sources
arXiv2016

Transversals as generating sets in finitely generated groups

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which contains a generating set of size $n$ for $G$, and that the construction is algorithmic when $G$ is finitely presented. We also show that, in the case where $G$ has rank $n \leq3$, there is a simultaneous left-right transversal for $H$ which contains a generating set of size $n$ for $G$. We finish by showing that if $H$ is a subgroup of a rank $n$ group $G$ with index less than $3 \cdot 2^{n-1}$, and $H$ contains no primitive elements of $G$, then $H$ is normal in $G$ and $G/H \cong C_{2}^{n}$.

math.GR↗
arXiv2016

Finitely annihilated groups

We say a group is finitely annihilated if it is the set-theoretic union of all its proper normal finite index subgroups. We investigate this new property, and observe that it is independent of several other well known group properties. For finitely generated groups, we show that in many cases it is equivalent to having non-cyclic abelianisation, and at the same time construct an explicit infinite family of counterexamples to this. We show for finitely presented groups that this property is neither Markov nor co-Markov. In the context of our work we show that the weight of a non-perfect finite group, or a non-perfect finitely generated solvable group, is the same as the weight of its abelianisation. We generalise a theorem of Brodie-Chamberlain-Kappe on finite coverings of groups, and finish with some generalisations and variations of our new definition.

math.GR↗
arXiv2016

The subgroup identification problem for finitely presented groups

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as an investigation into the difference between strong and weak effective coherence for finitely presented groups.

math.GR↗
arXiv2016

On torsion in finitely presented groups

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known result, the existence of a universal finitely presented torsion-free group; one into which all finitely presented torsion-free groups embed. We apply our techniques to show that recognising embeddability of finitely presented groups is $Π^{0}_{2}$-hard, $Σ^{0}_{2}$-hard, and lies in $Σ^{0}_{3}$. We also show that the sets of orders of torsion elements of finitely presented groups are precisely the $Σ^{0}_{2}$ sets which are closed under taking factors.

math.GR↗
arXiv2016

Preserving torsion orders when embedding into groups with `small' finite presentations

We give a complete survey of a construction by Boone and Collins for embedding any finitely presented group into one with $8$ generators and $26$ relations. We show that this embedding preserves the set of orders of torsion elements, and in particular torsion-freeness. We combine this with the independent results of Belegradek and Chiodo to prove that there is an $8$-generator $26$-relator universal finitely presented torsion-free group (one into which all finitely presented torsion-free groups embed).

math.GR↗
arXiv2016

$X$-torsion and universal groups

For a set $X\subseteq \mathbb{N}$, we define the $X$-torsion of a group $G$ to be all elements $g\in G$ with $g^{n}=e$ for some $n\in X$. With $X$ recursively enumerable, we give two independent proofs (group-theoretic, and model-theoretic) that there exists a universal finitely presented $X$-torsion-free group; one which contains all finitely presented $X$-torsion-free groups. We also show that, if $X$ is recursively enumerable, then the set of finite presentations of $X$-torsion-free groups is $Π_{2}^{0}$-complete in Kleene's arithmetic hierarchy.

math.GR↗
arXiv2016

A note on torsion length

We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.

math.GR↗
arXiv2010

Finding non-trivial elements and splittings in groups

It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If not, then this would resolve an open problem by J. Wiegold: `Is every finitely generated perfect group the normal closure of one element?' We prove a weakened version of our question: there is no general procedure to pick a non-trivial generator from a finite presentation of a non-trivial group. We also show there is neither a general procedure to decompose a finite presentation of a non-trivial free product into two non-trivial finitely presented factors, nor one to construct an embedding from one finitely presented group into another in which it embeds. We apply our results to show that a construction by Stallings on splitting groups with more than one end can never be made algorithmic, nor can the process of splitting connect sums of non-simply connected closed 4-manifolds.

math.GR↗