ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A={a1,…,an}A=\{a_1,\dots,a_n\} and B={b1,…,bn}B=\{b_1,\dots,b_n\} be sets of nn distinct real numbers, and let π\pi be uniform in SnS_n. For a real-valued random variable XX, write Q(X)=sup⁡x∈RP(X=x)Q(X)=\sup_{x\in\mathbb R}\mathbb{P}(X=x) for its concentration function. The sharp permutation anticoncentration conjecture.

Q(∑i=1naibπ(i))≤(122π+o(1))n−5/2.Q\left(\sum_{i=1}^n a_i b_{\pi(i)}\right)\leq\left(\frac{12}{\sqrt{2\pi}}+o(1)\right)n^{-5/2}.

This conjecture seeks to remove the no(1)n^{o(1)} 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 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.