Necklace character-sum conjecture for localized Paley graphs
Necklace character-sum conjecture for localized Paley graphs
Let be prime, let be the Legendre symbol, and for nonempty subsets define
Necklace character-sum conjecture. For every ,
These estimates are designed to imply the weak-convergence conjecture for localized Paley graph spectra. They are stated as a stronger analytic input and remain open in the general degree- setting.
Sources & referencesView supporting material
Primary source
Dmitriy Kunisky, “Spectral pseudorandomness and the road to improved clique number bounds for Paley graphs”, arXiv:2303.16475 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.