Gaussian-width conjecture for arithmetic-progression counts
Statement
Let be the -term arithmetic-progression count on a finite set of size , and let denote the Gaussian width of the set of normalized gradients of . For fixed , the authors conjecture that
Gaussian-width conjecture. For any fixed ,
The authors have the lower bound , so this conjecture asserts that the lower bound is essentially tight up to polylogarithmic factors. It would sharpen the available Gaussian-width bounds for arithmetic-progression counts.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.