• Login
    View Item 
    •   SMARTech Home
    • Georgia Tech Theses and Dissertations
    • Georgia Tech Theses and Dissertations
    • View Item
    •   SMARTech Home
    • Georgia Tech Theses and Dissertations
    • Georgia Tech Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Finite Field Models of Roth's Theorem in One and Two Dimensions

    Thumbnail
    View/Open
    hart_derrick_n_200608_mast.pdf (218.5Kb)
    Date
    2006-06-05
    Author
    Hart, Derrick N.
    Metadata
    Show full item record
    Abstract
    Recent 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.
    URI
    http://hdl.handle.net/1853/11516
    Collections
    • Georgia Tech Theses and Dissertations [21022]
    • School of Mathematics Theses and Dissertations [377]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology

    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology