Singular Gauss sums, Polya-Vinogradov inequality for $GL(2)$ and growth of primitive elements
Number Theory
2021-06-10 v2 Group Theory
Abstract
We establish an analogue of the classical Polya-Vinogradov inequality for , where is a prime. In the process, we compute the `singular' Gauss sums for . As an application, we show that the collection of elements in whose reduction modulo are of maximal order in and whose matrix entries are bounded by has the expected size as soon as for any . In particular, there exist elements in with matrix entries that are of the order whose reduction modulo are primitive elements.
Keywords
Cite
@article{arxiv.1912.01310,
title = {Singular Gauss sums, Polya-Vinogradov inequality for $GL(2)$ and growth of primitive elements},
author = {Satadal Ganguly and C. S. Rajan},
journal= {arXiv preprint arXiv:1912.01310},
year = {2021}
}
Comments
Modified version, with another proof on the growth of primitive elements based on Weil estimates added; 41 pages