Abstract
In 1981 Beck and Fiala proved an upper bound for the discrepancy of a set system of degree d that is independent of the size of the ground set. In the intervening years the bound has been decreased from 2d − 2 to 2d − 4. We improve the bound to 2d − log*d.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Discrepancy and sparsity;Journal of Combinatorial Theory, Series B;2024-11
2. The Vector Balancing Constant for Zonotopes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. The Phase Transition of Discrepancy in Random Hypergraphs;SIAM Journal on Discrete Mathematics;2023-08-17
4. Multidimensional political apportionment;Proceedings of the National Academy of Sciences;2022-04-08
5. The discrepancy of random rectangular matrices;Random Structures & Algorithms;2021-10-17