Abstract
We establish an analogue of the classical Polya–Vinogradov inequality for $$GL(2, {\mathbbm {F}}_p)$$ , where p is a prime. In the process, we compute the ‘singular’ Gauss sums for $$GL(2, {\mathbbm {F}}_p)$$ . As an application, we show that the collection of elements in $$GL(2,{\mathbbm {Z}})$$ whose reduction modulo p are of maximal order in $$GL(2, {\mathbbm {F}}_p)$$ and whose matrix entries are bounded by x has the expected size as soon as $$x\gg p^{1/2+\varepsilon }$$ for any $$\varepsilon >0$$ .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.