SearcharxivSearch

arXiv · 1710.03432

Computing $n^{\rm th}$ roots in $SL_2$ and Fibonacci polynomials

Abstract

Let $k$ be a field of characteristic $\neq 2$. In this paper we study squares, cubes and their products in split and anisotropic groups of type $A_1$. In split case, we show that computing $n^{\rm th}$ roots is equivalent to finding solutions of certain polynomial equations in at most two variables over the base field $k$. The description of these polynomials involves generalised Fibonacci polynomials. Using this we obtain asymptotic proportions of $n^{\rm th}$ powers, and conjugacy classes which are $n^{\rm th}$ powers, in ${\rm SL}_2(\mathbb F_q)$ when $n$ is a prime or $n = 4$. We also extend already known Waring type result for ${\rm SL}_2(\mathbb F_q)$, that every element of ${\rm SL}_2(\mathbb F_q)$ is a product of two squares, to ${\rm SL}_2(k)$ for an arbitrary $k$. For anisotropic groups of type $A_1$, namely ${\rm SL}_1(Q)$ where $Q$ is a quaternion division algebra, we prove that when $2$ is a square in $k$, every element of ${\rm SL}_1(Q)$ is a product of two squares if and only if $-1$ is a square in ${\rm SL}_1(Q)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Amit Kulshrestha, Anupam Singh. 2017-10-10. Computing $n^{\rm th}$ roots in $SL_2$ and Fibonacci polynomials. https://arxiv.org/abs/1710.03432

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