Sommes friables d'exponentielles et applications
Number Theory
2019-08-15 v2
Abstract
An integer is said to be -friable if its greatest prime factor is less than . In this paper, we obtain estimates for exponential sums over -friable numbers up to which are non-trivial when . As a consequence, we obtain an asymptotic formula for the number of -friable solutions to the equation which is valid unconditionnally under the same assumption. We use a contour integration argument based on the saddle point method, as developped in the context of friable numbers by Hildebrand & Tenenbaum, and used by Lagarias, Soundararajan and Harper to study exponential and character sums over friable numbers.
Cite
@article{arxiv.1302.4318,
title = {Sommes friables d'exponentielles et applications},
author = {Sary Drappeau},
journal= {arXiv preprint arXiv:1302.4318},
year = {2019}
}
Comments
31 pages, in French