## Visualizing Discrete Fourier Coefficients

Over the course of the 2010 University of Georgia REU, we spent an extensive amount of time understanding and applying properties of the discrete Fourier transform to topics in arithmetic combinatorics. In order to get an intuitive idea of what we were really looking at, I wrote a GUI program in Python to visualize the . . . [Read More]

## On Fourier Pseudorandomness

As a final project at the 2010 University of Georgia mathematics REU, I wrote a manuscript discussing the properties and meaning of a mathematical notion called Fourier Pseudorandomness, which provides a quantitative measure of the randomness (in some sense) of a finite set of integers. Some of the more involved proofs require a first course . . . [Read More]

## Behrend’s Construction

How large can a set of integers be without containing any 3-term arithmetic progressions? German mathematician Felix Behrend provided a construction in 1946 which gave an example of a fairly large set lacking such progressions. The main idea of the work is to use the fact that a line may intersect with a sphere . . . [Read More]