Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We consider sums of oscillating functions on intervals in cyclic groups of size close to the square root of the size of the group. We first prove non-trivial estimates for intervals of length slightly larger than this square root (bridging the "Polya-Vinogradov gap" in some sense) for bounded functions with bounded Fourier transforms. We then prove that the existence of non-trivial estimates for ranges slightly below the square-root bound is stable under the discrete Fourier transform. We then give applications related to trace functions over finite fields.
Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Sabrina Laneve, Ludovica Schaerf
Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Sabrina Laneve, Ludovica Schaerf
Laurent Villard, Stephan Brunner, Alberto Bottino, Moahan Murugappan