Small progress towards the Paley graph conjecture

Abstract: The question of determining the largest independent set in a Paley graph (a special kind of Cayley graph) is connected to the classical question of Vinogradov on determining the least quadratic non-residue modulo a given prime. This connection will be discussed and small progress in the state-of-the-art will be presented.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456