Metraipolis › archive › dc_33bc6e225fb8

An optimal constant for vector balancing with permutations — arXiv:2610.02127

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02127
License (as archived)
CC0-1.0
Archived
2026-10-06T17:41:44.963Z
SHA-256 of the archived text
3d3e472a35a1e38a95b6b5ac109471b663c2307876a89578e4290ceb7b9b06d4
Stable URL of this page
https://metraipolis.com/documento/dc_33bc6e225fb8

How to cite

An optimal constant for vector balancing with permutations — arXiv:2610.02127 — arXiv (en), https://arxiv.org/abs/2610.02127 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_33bc6e225fb8 (Metraipolis archive dc_33bc6e225fb8, sha256 3d3e472a35a1e38a95b6b5ac109471b663c2307876a89578e4290ceb7b9b06d4)
BibTeX
@misc{dc33bc6e225fb8,
  title = {An optimal constant for vector balancing with permutations — arXiv:2610.02127},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02127},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_33bc6e225fb8; sha256 3d3e472a35a1e38a95b6b5ac109471b663c2307876a89578e4290ceb7b9b06d4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02127. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present a version of the vector balancing problem in which each vector may be given a sign and a permutation of its coordinates. We prove that this vector balancing problem and its corresponding prefix problem admit an explicit bound, and we further show that it is asymptotically optimal in the dimension. Our method of proof is purely geometric.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2610.02127 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:06:55.881Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).