Exponential sums and additive combinatorics

Download files
Access & Terms of Use
open access
Copyright: Macourt, Simon
Abstract
In this thesis we provide new results in additive combinatorics which in turn lead us to new bounds of certain exponential sums. We also use known bounds on exponential and character sums to give new results in additive combinatorics. Specifically we will see how bounds on some quantities from additive combinatorics appear naturally when trying to bound multilinear exponential sums. We then find applications to bounds of exponential sums of sparse polynomials. We also give new bounds for an analogue of the energy variant of the sum-product problem over arbitrary finite fields.
Persistent link to this record
Link to Publisher Version
Additional Link
Author(s)
Macourt, Simon
Supervisor(s)
Shparlinski, Igor
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2020
Resource Type
Thesis
Degree Type
PhD Doctorate
UNSW Faculty
Files
download public version.pdf 1.13 MB Adobe Portable Document Format
Related dataset(s)