{"paper":{"title":"Differencing Methods for Korobov-type exponential sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joseph Vandehey","submitted_at":"2016-06-25T13:17:02Z","abstract_excerpt":"We study exponential sums of the form $\\sum_{n=1}^N e^{2\\pi i a b^n/m}$ for non-zero integers $a,b,m$. Classically, non-trivial bounds were known for $N\\ge \\sqrt{m}$ by Korobov, and this range has been extended significantly by Bourgain as a result of his and others' work on the sum-product phenomenon. We use a new technique, similar to the Weyl-van der Corput method of differencing, to give more explicit bounds bounds that become non-trivial around the time when $\\exp(\\log m/\\log_2\\log m) \\le N$. We include applications to the digits of rational numbers and constructions of normal numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07911","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}