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 in number theory in order to be comprehensible. However, the majority of the exposition–in particular the theorem statements and general themes–calls only for an understanding of the basic notions of complex arithmetic and a sufficiently persistent and interested reader.

On Fourier Pseudorandomness (PDF)

Feel free to ask questions, request clarification, pick nits, and otherwise discuss in the comments!

1 comment to On Fourier Pseudorandomness

Leave a Reply to Visualizing Discrete Fourier Coefficients « Epsilon Small




You can use these HTML tags

<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>