Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/3200
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulshrestha, Amit-
dc.date.accessioned2020-12-18T05:19:34Z-
dc.date.available2020-12-18T05:19:34Z-
dc.date.issued2020-
dc.identifier.citationProceedings of the Indian Academy of Sciences: Mathematical Sciences, 130 (1)en_US
dc.identifier.other10.1007/s12044-020-0559-8-
dc.identifier.urihttps://www.ias.ac.in/article/fulltext/pmsc/130/0031-
dc.identifier.urihttp://hdl.handle.net/123456789/3200-
dc.descriptionOnly IISERM authors are available in the record.-
dc.description.abstractLet k be a field of characteristic ≠ 2. In this paper, we study squares, cubes and their products in split and anisotropic groups of type A1. In the split case, we show that computing n-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-th powers, and conjugacy classes which are n-th powers, in SL 2(Fq) when n is a prime or n= 4. We also extend the already known Waring type result for SL 2(Fq) , that every element of SL 2(Fq) is a product of two squares, to SL 2(k) for an arbitrary k. For anisotropic groups of type A1, namely SL 1(Q) where Q is a quaternion division algebra, we prove that when 2 is a square in k, every element of SL 1(Q) is a product of two squares if and only if - 1 is a square in SL 1(Q).en_US
dc.language.isoen_USen_US
dc.publisherSpringeren_US
dc.subjectFibonacci polynomialsen_US
dc.subjectn-th rootsen_US
dc.subjectSL 2en_US
dc.titleComputing n -th roots in SL2 and Fibonacci polynomialsen_US
dc.typeArticleen_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
Need to add pdf.odt8.63 kBOpenDocument TextView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.