Spectral pseudorandomness and the clique number of the Paley graph
Dmitriy (Tim) Kunisky (Yale University)
E18-304
Abstract: The Paley graph is a classical number-theoretic construction of a graph that is believed to behave "pseudorandomly" in many regards. Accurately bounding the clique number of the Paley graph…