Bounds for Kloosterman sums on .

This paper establishes power-saving bounds for Kloosterman sums associated with the long Weyl element for for arbitrary , as well as for another type of Weyl element of order 2. These bounds are obtained by establishing an explicit representation as exponential sums. As an application we go beyond Sarnak's density conjecture for the principal congruence subgroup of prime level.

Interesting identities involving weighted representations of integers as sums of arbitrarily many squares.

We consider the number of ways to write an integer as a sum of squares, a problem with a long history going back at least to Fermat. The previous studies in this area generally fix the number of squares which may occur and then either use algebraic techniques or connect these to coefficients of certain complex analytic functions with many symmetries known as modular forms, from which one may use techniques in complex and real analysis to study these numbers. In this paper, we consider sums with arbitrarily many squares, but give a certain natural weighting to each representation.