Quasi-random graphs from varieties over finite fields

We show that some graphs defined using polynomials over finite fields, generalizing the Paley graph, satisfy the same quasirandomness inequality as the Paley graph. Proving this turns out to require the advanced algebraic geometry tools developed in Deligne’s second proof of the Weil conjectures.