Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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.
Laurent Villard, Stephan Brunner, Moahan Murugappan