ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let v1,…,vn∈R2v_1,\dotsc,v_n\in\mathbb{R}^2 be unit vectors, and let ε1,…,εn\varepsilon_1,\dotsc,\varepsilon_n be independent random signs, each uniformly distributed in {−1,1}\{-1,1\}. He–Juškevičius–Narayanan–Spiro conjecture. There is a constant c>0c>0 such that, for every odd nn,

P ⁣[∥∑i=1nεivi∥2≤1]≥cn.\mathbb{P}\!\left[\left\|\sum_{i=1}^n\varepsilon_i v_i\right\|_2\leq 1\right]\geq\frac{c}{n}.

This is the proposed odd-nn case of Erdős's conjecture, motivated by the fact that the known obstruction requiring radius 2\sqrt{2} works only for even nn; whether the asserted lower bound holds remains open in the supplied text.

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.