ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime pp, let GpG_p be the Paley graph, let G‾p\overline G_p be its complement, and write α(Gp)=ω(G‾p)\alpha(G_p)=\omega(\overline G_p) for its independence number. Here polylog(p)\mathsf{polylog}(p) denotes a fixed polylogarithmic function of pp. Polylogarithmic independence-number conjecture.

α(Gp)=O(polylog(p)).\alpha(G_p)=O(\mathsf{polylog}(p)).

Determining the independence number is a central problem connected with bounds for quadratic non-residues and Ramsey theory. The statement is described as widely believed, but remains open in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.