2000 character limit reached
Character sums estimates and an application to a problem of Balog
Published 4 Apr 2020 in math.NT and math.CO | (2004.01885v1)
Abstract: We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.
Sponsor
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.