Necklace character-sum conjecture for localized Paley graphs

Let pp be prime, let χ:Fp{1,0,1}\chi:\mathbb F_p\to\{-1,0,1\} be the Legendre symbol, and for nonempty subsets Z1,,ZkFpZ_1,\ldots,Z_k\subseteq\mathbb F_p define

Σ(Z1,,Zk)=x1,,xkFpχ(x2x1)χ(xkxk1)χ(x1xk)i=1kzZiχ(xiz).\Sigma(Z_1,\ldots,Z_k)=\sum_{x_1,\ldots,x_k\in\mathbb F_p}\chi(x_2-x_1)\cdots\chi(x_k-x_{k-1})\chi(x_1-x_k)\prod_{i=1}^k\prod_{z\in Z_i}\chi(x_i-z).

Necklace character-sum conjecture. For every k1k\geq1,

limpp(k/2+1)maxZ1,,ZkFpZiZ1ZkaΣ(Z1,,Zk)=0.\lim_{p\to\infty}p^{-(k/2+1)}\max_{\substack{Z_1,\ldots,Z_k\subseteq\mathbb F_p\Z_i\neq\varnothing\\|Z_1\cup\cdots\cup Z_k|\leq a}}|\Sigma(Z_1,\ldots,Z_k)|=0.

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-aa 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

No solutions have been posted yet.