Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01wh246w130
Title: Points, Lines, and Polynomials: The Kakeya Problem and the Polynomial Method
Authors: Long, Theodore
Advisors: Dvir, Zeev
Department: Mathematics
Certificate Program: Applications of Computing Program
Class Year: 2020
Abstract: The Kakeya Conjecture is a long-standing problem in analysis about the size and dimension of sets in \( \mathbb{R}^n \) containing a unit line segment in every direction, known as Kakeya or Besicovitch sets. This thesis studies the analogous discrete problem of the size of such sets in \( \mathbb{F}_q^n \), where a Kakeya set is similarly defined as containing an entire line in every direction. This problem is solved using the polynomial method, which seeks to obtain results about combinatorial objects by describing their structure through the vanishing sets of polynomials. We discuss various aspects of the polynomial method, its application to the discrete Kakeya problem, and applications of Kakeya sets in Information Theory.
Type of Material: Princeton University Senior Theses
Language: en
Appears in Collections:Mathematics, 1934-2020
Aeronautical Engineering, 1945-1975

Files in This Item:
File Description SizeFormat 
LONG-THEODORE-THESIS.pdf1 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.