Spencer's theorem in nearly input-sparsity time

TL;DR

This paper presents a near input-sparsity time algorithm for Spencer's discrepancy theorem, utilizing a novel width reduction technique for linear programs, advancing computational efficiency in discrepancy minimization.

Contribution

It introduces the first nearly input-sparsity time algorithm for Spencer's theorem, employing a new width reduction method for linear programs with the multiplicative weights update.

Findings

Algorithm achieves near input-sparsity time complexity

Introduces a novel width reduction technique for linear programs

Demonstrates efficiency in discrepancy minimization problems

Abstract

A celebrated theorem of Spencer states that for every set system $S_1,\dots, S_m \subseteq [n]$, there is a coloring of the ground set with $\{\pm 1\}$ with discrepancy $O(\sqrt{n\log(m/n+2)})$. We provide an algorithm to find such a coloring in near input-sparsity time $\tilde{O}(n+\sum_{i=1}^{m}|S_i|)$. A key ingredient in our work, which may be of independent interest, is a novel width reduction technique for solving linear programs, not of covering/packing type, in near input-sparsity time using the multiplicative weights update method.