ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B2dB_2^d denote the Euclidean unit ball in Rd\mathbb{R}^d, and let S(B2d)S(B_2^d) be its Steinitz constant: the smallest CC such that every finite set of vectors V⊂B2dV\subset B_2^d with sum zero admits an ordering whose partial sums have Euclidean norm at most CC. Bergström's conjecture. For all d≥1d\geq 1,

S(B2d)=O(d).S(B_2^d)=O(\sqrt{d}).

This conjecture, known as the Steinitz problem, sought a much stronger estimate than the general bound S(B)≤dS(B)\leq d. The supplied status evidence says that it has been refuted.

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.