Preprint in the OpenAI Math release
The Euclidean Steinitz–Bergström theorem
OpenAI
Abstract
Every prescribed-order finite sequence of vectors in the Euclidean unit ball of ℝ has one signing for which every signed prefix has norm at most , with C absolute and independent of the sequence length. Consequently, every indexed zero-sum family of unit-ball vectors admits an ordering with the same bound for its unsigned partial sums. This determines the Euclidean Steinitz constant up to absolute factors, , and resolves the Euclidean Steinitz–Bergström conjecture.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.