Pith. sign in

REVIEW

On short sums of trace functions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1508.00512 v3 pith:AOKFBNB6 submitted 2015-08-03 math.NT

On short sums of trace functions

classification math.NT
keywords functionsboundedestimatesfourierintervalsnon-trivialproveroot
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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 "Poly\'a-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, and we give applications related to trace functions over finite fields.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.