Computing $n^{\rm th}$ roots in $SL_2$ and Fibonacci polynomials
Amit Kulshrestha, Anupam Singh

TL;DR
This paper investigates the computation of $n^{ m th}$ roots in groups of type $A_1$, using polynomial equations involving Fibonacci polynomials, and extends known results about expressing elements as products of squares in these groups.
Contribution
It provides a polynomial equation framework for $n^{ m th}$ roots in split groups and extends Waring type results to arbitrary fields, also characterizing products of squares in anisotropic groups.
Findings
Computing $n^{ m th}$ roots reduces to solving polynomial equations with Fibonacci polynomials.
Asymptotic proportions of $n^{ m th}$ powers in ${ m SL}_2( ext{finite field})$ are obtained.
Every element of ${ m SL}_2(k)$ is a product of two squares over arbitrary fields under certain conditions.
Abstract
Let be a field of characteristic . In this paper we study squares, cubes and their products in split and anisotropic groups of type . In split case, we show that computing roots is equivalent to finding solutions of certain polynomial equations in at most two variables over the base field . The description of these polynomials involves generalised Fibonacci polynomials. Using this we obtain asymptotic proportions of powers, and conjugacy classes which are powers, in when is a prime or . We also extend already known Waring type result for , that every element of is a product of two squares, to for an arbitrary . For anisotropic groups of type , namely where is a quaternion division algebra, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Advanced Algebra and Geometry
