Georgia Institute of Technology
Finite Field Models of Roth's Theorem in One and Two Dimensions
Abstract
dc:description.abstractRecent work on many problems in additive combinatorics, such as Roth's Theorem, has shown the usefulness of first studying the problem in a finite field environment. Using the techniques of Bourgain to give a result in other settings such as general abelian groups, the author gives a walk through, including proof, of Roth's theorem in both the one dimensional and two dimensional cases (it would be more accurate to refer to the two dimensional case as Shkredov's Theorem). In the one dimensional case the argument is at its base Meshulam's but the structure will be essentially Green's. Let Ϝⁿ [subscript p], p ≠ 2 be the finite field of cardinality N = pⁿ. For large N, any subset A ⊂ Ϝⁿ [subscript p] of cardinality ∣A ∣≳ N ∕ log N must contain a triple of the form {x, x + d, x + 2d} for x, d ∈ Ϝⁿ [subscript p], d ≠ 0. In the two dimensional case the argument is Lacey and McClain who made considerable refinements to this argument of Green who was bringing the argument to the finite field case from a paper of Shkredov. Let Ϝ ⁿ ₂ be the finite field of cardinality N = 2ⁿ. For all large N, any subset A⊂ Ϝⁿ ₂ × Ϝⁿ ₂ of cardinality ∣A ∣≳ N ² (log n) − [superscript epsilon], ε <, 1, must contain a corner {(x, y), (x + d, y), (x, y + d)} for x, y, d ∈ Ϝⁿ₂ and d ≠ 0.
Degree
thesis:*- Department dc:contributor.department
- Mathematics
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2006
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hart, Derrick N.
- Advisor dc:contributor.advisor
-
- Lacey, Michael T.
- Committee members dc:contributor.committeemember
-
- Green, Bill
- Tetali, Prasad
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/11516