The sharp permutation anticoncentration conjecture for sets
Statement
Let and be sets of distinct real numbers, and let be uniform in . For a real-valued random variable , write for its concentration function. The sharp permutation anticoncentration conjecture.
This conjecture seeks to remove the loss from the near-optimal bound for permutation anticoncentration when both coefficient families are sets. It is presented as an analogue of the sharp Sárközy–Szemerédi and Stanley bounds for the classical Littlewood–Offord model; its resolution is not given here.
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.