arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.07945cs.DS
收藏

遗传离散性与行列式下界的一个更紧密的关系

A Tighter Relation Between Hereditary Discrepancy and Determinant Lower Bound

Haotian Jiang, Victor Reis

摘要:

在开创性的工作中,Lovász,Spencer和Vesztergombi [European J. Combin。1986]证明了矩阵$A \in \mathbb{R}^{m \times n}$在$A$的所有$k \times k$子矩阵$B$上的最大值$|\det(B)|^{1/k}$的遗传差异的下界。我们在算法上证明,这个行列式下限最多可以偏离$O(\sqrt{\log (m) \cdot \log (n)})$的一个因子,这比Matoušek给出的$O(\log(mn) \cdot \sqrt{\log (n)})$的先前界限有所改进[Proc. of the AMS,2013]。对于满足$|\mathcal{F}_1 \cup \mathcal{F}_2| = m$的任意两个集合系统$\mathcal{F}_1, \mathcal{F}_2$ over $[n]$,我们的结果直接蕴涵了$\mathrm{herdisc}(\mathcal{F}_1 \cup \mathcal{F}_2) \leq O(\sqrt{\log (m) \cdot \log (n)}) \cdot \max(\mathrm{herdisc}(\mathcal{F}_1), \mathrm{herdisc}(\mathcal{F}_2))$.我们的界限是紧常数时,$m = O(\mathrm{poly}(n))$由于建设Pálvölgyi [离散计算。Geom.,2010]或Newman,Neiman和Nikolov的Beck三置换猜想的反例[FOCS,2012]。

英文摘要:

In seminal work, Lovász, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$ submatrices $B$ of $A$. We show algorithmically that this determinant lower bound can be off by at most a factor of $O(\sqrt{\log (m) \cdot \log (n)})$, improving over the previous bound of $O(\log(mn) \cdot \sqrt{\log (n)})$ given by Matoušek [Proc. of the AMS, 2013]. Our result immediately implies $\mathrm{herdisc}(\mathcal{F}_1 \cup \mathcal{F}_2) \leq O(\sqrt{\log (m) \cdot \log (n)}) \cdot \max(\mathrm{herdisc}(\mathcal{F}_1), \mathrm{herdisc}(\mathcal{F}_2))$, for any two set systems $\mathcal{F}_1, \mathcal{F}_2$ over $[n]$ satisfying $|\mathcal{F}_1 \cup \mathcal{F}_2| = m$. Our bounds are tight up to constants when $m = O(\mathrm{poly}(n))$ due to a construction of Pálvölgyi [Discrete Comput. Geom., 2010] or the counterexample to Beck's three permutation conjecture by Newman, Neiman and Nikolov [FOCS, 2012].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑