SearcharxivSearch

arXiv · 2508.15399

Involutive minimal generating sets with two commuting involutions of Extended Special Linear group $ES{L_3}(\mathbb{Z})$, $ES{L_2}(\mathbb{Z})$ and analytical and recursive formulas of roots in SL$_3(\mathbb{F}_p)$ \RomanNumeralCaps{3}

Abstract

In this research we continue our previous investigation of wreath product normal structure \cite{SkuESL}. We generalize the group of unimodular matrices \cite{Amit} and find its structure. For this goal we propose one extension of the special linear group. Groups generated by three involutions, two of which are permutable, have long been of interest in the theory of matrix groups \cite{Maz}, for instance such generating set was researched for $S{{L}_{2}}({{\mathbb{Z}+ i\mathbb{Z}}})$. But for size of matrix 3 on 3 this is imposable for some groups. We research this question for $ES{{L}_{3}}({{\mathbb{Z}}})$. An analytical formula of root in $SL(3, \mathbb{Z}$) is found, recursive formula for $n$-th power root in $SL(2, \mathbb{Z}$) is found too.

Explore related subjects

Keep this discovery

BibTeXRIS

R. V. Skuratovskii. 2025-08-21. Involutive minimal generating sets with two commuting involutions of Extended Special Linear group $ES{L_3}(\mathbb{Z})$, $ES{L_2}(\mathbb{Z})$ and analytical and recursive formulas of roots in SL$_3(\mathbb{F}_p)$ \RomanNumeralCaps{3}. https://arxiv.org/abs/2508.15399

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