2000 character limit reached
Incomplete exponential sums over exponential functions
Published 18 Feb 2013 in math.NT | (1302.4170v1)
Abstract: We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e{2\pi iagn/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning additive properties of multiplicative subgroups imply new bounds for the sums under consideration.
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.