On The Hereditary Discrepancy of Homogeneous Arithmetic Progressions

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by n1/O(loglogn). This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound on the discrepancy of set systems of subcubes of the boolean cube {0,1}d