ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n,k≥1n,k\geq 1, let En\mathbb{E}^n denote nn-dimensional Euclidean space, and let ℓs\ell_s denote a set of ss equally spaced collinear points. Write En→(ℓs,ℓk)\mathbb{E}^n\rightarrow(\ell_s,\ell_k) if every red-blue coloring of En\mathbb{E}^n contains either a red copy of ℓs\ell_s or a blue copy of ℓk\ell_k. The minimal-length conjecture. There is an integer kk such that for every integer nn,

En↛(ℓ3,ℓk).\mathbb{E}^n\not\rightarrow(\ell_3,\ell_k).

This conjecture asks whether three is the smallest first progression length for which some fixed blue progression length avoids the corresponding Euclidean Ramsey property in every dimension. The preceding results establish related positive and negative statements for other progression lengths, but the conjectured case s=3s=3 remains open.

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.