Improving the BeckFiala discrepancy bound

Determine whether the bound in the BeckFiala theorem can be improved from O(d) to O(sqrt(d)), or at least to o(d), for set systems in which each ground-set element belongs to at most d sets.

Background

The BeckFiala theorem states that a set system whose elements occur in at most d sets has discrepancy O(d). The paper's factorization theorem recovers this result as a special case of a more general discrepancy bound based on sparse factorizations.

The authors explicitly identify the sharper square-root bound, and even any sublinear improvement, as unresolved. This is a separate open problem from the paper's gamma_2 conjecture because it concerns bounded incidence multiplicity rather than bounded factorization norm.