Metaplectic cusp forms and the large sieve

Abstract

We prove a power saving upper bound for the sum of Fourier coefficients f(·) of a fixed cubic metaplectic cusp form f over primes. Our result is the cubic analogue of a celebrated 1990 Theorem of Duke and Iwaniec, and the cuspidal analogue of a Theorem due to the author and Radziwill for the bias in cubic Gauss sums. The proof has two main inputs, both of independent interest. Firstly, we prove a new large sieve estimate for a bilinear form whose kernel function is f(·). The proof of the bilinear estimate uses a number field version of circle method due to Browning and Vishe, Voronoi summation, and Gauss-Ramanujan sums. Secondly, we use Voronoi summation and the cubic large sieve of Heath-Brown to prove an estimate for a linear form involving f(·). Our linear estimate overcomes a bottleneck occurring at level of distribution 2/3.

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…