2000 character limit reached
GCD sums and sum-product estimates
Published 20 Jun 2018 in math.NT | (1806.07849v1)
Abstract: In this note we prove a new estimate on so-called GCD sums (also called G\'{a}l sums), which, for certain coefficients, improves significantly over the general bound due to de la Bret`{e}che and Tenenbaum. We use our estimate to prove new results on the equidistribution of sequences modulo 1, improving over a result of Aistleitner, Larcher, and Lewko on how the metric poissonian property relates to the notion of additive energy. In particular, we show that arbitrary subsets of the squares are metric poissonian.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.