Repository navigation
0.1.0-candidate: Prefix balancing with signs and coordinate permutations
Pre-releaseUnrefereed research candidate. Prefix balancing with signs and coordinate permutations: the exact constant 5/2 in dimension four and online bounds above 5/2.
Vectors with entries in [-1, 1] arrive one at a time; each may be sign-flipped and have its coordinates permuted, and every running total should stay small in the largest-coordinate norm. Niles-Weed, Sadovsky and Shkrob (arXiv:2610.02127, 2026) posed the problem, proved the bound 3 - 2/n and recorded the lower bound 2.
- Five fixed vectors force a running total of size at least 5/2 in every even dimension n >= 4 (Theorem 3.1); so the sharp constant in dimension four is exactly 5/2, offline and online (Corollary 4.3).
- Deterministic online strategies: at least 5/2 for every n >= 4, strictly above 5/2 for every n >= 8, at least 161/64 for every n >= 52 (plateau amplification lemma, Section 5).
- Dimension three, online: at least 13/6 (computer-checked certificate).
- Open: beating 5/2 offline; sharpness of 3 - 2/n in general.
DOI: https://doi.org/10.5281/zenodo.24239377 (concept 10.5281/zenodo.24239376). Release page: https://evidencepress.org/releases/signed-permutation-prefix-balancing/
Assets: the archive ZIP (complete package, identical to this tag), the paper PDF and RELEASE-SHA256SUMS. Internal AI-assisted review only; not peer review, independent reproduction or formal verification. Creator: Anonymous. Text CC0-1.0; code MIT.