SearcharxivSearch

arXiv · 2103.04793

Rewriting the elements in the intersection of the kernels of two morphisms between free groups

Abstract

Let F be the free group functor, left adjoint to the forgetful functor between the category of groups GRP and the category of sets SET. Let f from A to B, and h from A to C be two functions in SET and let Ker(F(f)) and Ker(F(h)) be the kernels of the induced morphisms between free groups. Provided that the kernel pairs Eq(f) and Eq(h) of f and h permute (such as it is the case when the pushout of f and h is a double extension in SET), this short article describes a method to rewrite a general element in the intersection of Ker(F(f)) and Ker(F(g)) as a product of generators in A which is (f,h)-symmetric in the sense of the higher covering theory of racks and quandles.

Explore related subjects

Keep this discovery

BibTeXRIS

François Renaud. 2021-03-08. Rewriting the elements in the intersection of the kernels of two morphisms between free groups. https://arxiv.org/abs/2103.04793

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR