Georgia Institute of Technology
Multifold sums and products over R, and combinatorial problems on sumsets
Abstract
dc:description.abstractWe prove a new bound on a version of the sum-product problem studied by Chang. By introducing several combinatorial tools, this expands upon a method of Croot and Hart which used the Tarry-Escott problem to build distinct sums from polynomials with specific vanishing properties. We also study other aspects of the sum-product problem such as a method to prove a dual to a result of Elekes and Ruzsa and a conjecture of J. Solymosi on combinatorial geometry. Lastly, we study two combinatorial problems on sumsets over the reals. The first involves finding Freiman isomorphisms of real-valued sets that also preserve the order of the original set. The second applies results from the former in proving a new Balog-Szemeredi type theorem for real-valued sets.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Mathematics
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Bush, Albert
- Advisor dc:contributor.advisor
-
- Croot, Ernest
- Committee members dc:contributor.committeemember
-
- Lacey, Michael
- Lyall, Neil
- Tetali, Prasad
- Trotter, William
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/53950