Reproduce “On the Guo-Fang-Lu Algorithm for Komlos Discrepancy” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Nikhil Bansal
The note explains a spectral method for signing elements so each set’s signed sum stays small. It weights medium rows by an exponential of their shrinking slack and bounds the largest eigenvalue of a Gram matrix. This limits dangerous rows to one per eight live coordinates, supporting an O(√k) Beck–Fiala bound for sufficiently large k; general Komlós is sketched.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.