版本更新 · v4arXiv:2504.18489
Tight Lower Bound for Multicolor Discrepancy
Pasin Manurangsi, Raghu Meka
We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $Ω(\sqrt{n})$. This improves on the previously known lower bound of $Ω(\sqrt{n/\log k})$ due to Caragiannis et al. (arXiv:2502.10516). As an application, we show that our result implies improved lower bounds for group fair division.
尚无 AI 解读，展示原文摘要
cs.DM · cs.GT