Matrix Kloosterman sums modulo prime powers

Exact enumeration problems, generating functions (05A15) Gauss and Kloosterman sums; generalizations (11L05) Relations between ergodic theory and number theory (37A44)

Abstract: We give optimal bounds for matrix Kloosterman sums modulo prime powers extending earlier work of the first two authors on the case of prime moduli. These exponential sums arise in the theory of the horocyclic flow on

m a t h r m {G L}_{n}

.

Review text

For a square matrix \(X\) we let \(\psi(X)=e^{2 \pi i \mathrm{Tr} X}\). In the paper under review, the authors provide bounds for the matrix Kloosterman sums \[ K_n(A,B; p^k)=\sum_{X\in \mathrm{GL}_n(\mathbb{Z}/p^k\mathbb{Z})} \psi((AX+X^{-1}B)/p^k), \] with given \(A,B\in \mathbb{Z}^{n\times n}\). Based on some auxiliary results, and assuming that \(k>1\), \(n>1\) and the matrices \(A, B\) are not both \(0\) modulo prime \(p\), they show that \[ |K_n(A,B;p^k)|\leq 2^n \begin{cases} p^{kn^2-\lceil\frac{k}{2}\rceil n} & \text{ for all } A,B,\\ p^{kn^2-\lceil\frac{k}{2}\rceil n^2} & \text{ if } \gcd(\det A,\det B,p)=1. \end{cases} \] The case \(k=1\) has been studied in a recent and under publication work.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Matrix Kloosterman sums modulo prime powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204755)