为ℓ₂前缀偏差和Steinitz问题提供近最优构造性界的方法
Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
AI总结:
本文提出一种高效算法,针对ℓ₂Steinitz问题在d≥Ω(log⁷n条件下达到O(√d)的猜想界,并扩展到更难的ℓ₂前缀偏差问题。
摘要:
经典的Steinitz定理于1913年提出,回答了Riemann和Lévy earlier的问题,指出对于任何实空间R^d中的范数||·||和满足∑_{i=1}^n v_i=0的向量集合v_1,⋯,v_n,存在一个排列π:[n]→[n],使得每个部分和都被O(d)所限制,即对于所有t∈[n],||∑_{i=1}^t v_{π(i)}||≤O(d)。Steinitz的界在一般情况下是紧的,但针对ℓ_2范数||·||_2,人们猜测最佳界是O(√d)。几乎一个世纪后,Banaszczyk的工作给出了ℓ_2Steinitz问题的界为O(√d + √log n),在d≥Ω(log n)的假设下匹配了猜测。Banaszczyk的结果是非构造性的,之前的最佳算法界是O(√(d log n)),由Bansal和Garg给出。在本文中,我们提出一个高效的算法,该算法在稍差但仍然是对数级别的条件下,即d≥Ω(log^7 n),达到了对ℓ_2Steinitz问题的猜测界O(√d)。正如先前的工作一样,我们的结果扩展到更困难的ℓ_2前缀偏差问题。我们采用通过离散布朗运动获得所需排列的框架,由半定规划(SDP)引导。为了获得我们的结果,我们使用了Bansal和Jiang提出的“通过仿射谱独立进行解耦”新技巧,以在Beck-Fiala和Komlós猜想上取得显著进展,同时结合一个“全局区间树”数据结构,该结构同时控制所有前缀的偏差。
英文摘要:
A classical result of Steinitz from 1913 \cite{Ste13}, answering an earlier question of Riemann and Lévy (e.g., \cite{Lev05}), states that for any norm $\|\cdot\|$ in $\mathbb{R}^d$ and any set of vectors $v_1, \cdots, v_n \in \R^d$ satisfying $\sum_{i=1}^n v_i = 0$, there exists an ordering $π: [n] \rightarrow [n]$ such that every partial sum along this order is bounded by $O(d)$, i.e., $\big\| \sum_{i=1}^t v_{π(i)} \big\| \leq O(d)$ for all $t \in [n]$. Steinitz's bound is tight up to constants in general, but for the $\ell_2$ norm $\|\cdot\|_2$, it has been conjectured that the best bound is $O(\sqrt{d})$. Almost a century later, a breakthrough work of Banaszczyk \cite{Ban12} gave a bound of $O(\sqrt{d} + \sqrt{\log n})$ for the $\ell_2$ Steinitz problem, matching the conjecture under the mild assumption that $d \geq Ω(\log n)$. Banaszczyk's result is non-constructive, and the previous best algorithmic bound was $O(\sqrt{d \log n})$, due to Bansal and Garg \cite{BG17}. In this work, we give an efficient algorithm that matches the conjectured $O(\sqrt{d})$ bound for the $\ell_2$ Steinitz problem under the slightly worse, yet still polylogarithmic, condition of $d \geq Ω(\log^7 n)$. As in prior work, our result extends to the harder problem of $\ell_2$ prefix discrepancy. We employ the framework of obtaining the desired ordering via a discrete Brownian motion, guided by a semidefinite program (SDP). To obtain our results, we use the new technique of ``Decoupling via Affine Spectral Independence'', proposed by Bansal and Jiang \cite{BJ26} to achieve substantial progress on the Beck-Fiala and Komlós conjectures, together with a ``Global Interval Tree'' data structure that simultaneously controls the deviations for all prefixes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。