Remembering Raymond Paley

Paley graphs Paley graphs play a role in my research, and they are an important family of graphs in combinatorics and graph theory. They are examples of quasi-random graphs: explicit, deterministic networks exhibiting properties we typically expect to see asymptotically in random graphs. Consider a prime power p congruent to 1 (mod 4), and let vertices be the elements of… Read More Remembering Raymond Paley