Equations and character sums with matrix powers, Kloosterman sums over small subgroups and quantum ergodicity

Abstract

We obtain a nontrivial bound on the number of solutions to the equation Ax1 + … + Ax = Ax+1 + … + Ax2, 1 x1, …,x2 τ, with a fixed n× n matrix A over a finite field Fq of q elements of multiplicative order τ. We give applications of our result to obtaining a new bound of additive character sums with a matrix exponential function, which is nontrivial beyond the square-root threshold. For n=2 this equation has been considered by Kurlberg and Rudnick (2001) (for =2) and Bourgain (2005) (for large ) in their study of quantum ergodicity for linear maps over residue rings. Here we use a new approach to improve their results. We also obtain a bound on Kloosterman sums over small subgroups, of size below the square-root threshold.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…