Discrepancy of arithmetic progressions in boxes and convex bodies

Abstract The combinatorial discrepancy of arithmetic progressions inside is the smallest integer for which can be colored with two colors so that any arithmetic progression in contains at most more elements from one color class than the other. Bounding the discrepancy of such set systems is a classical problem in the discrepancy theory. More recently, this problem was generalized to arithmetic progressions in grids like (Valkó) and (Fox, Xu, and Zhou). In the latter setting, Fox, Xu, and Zhou gave upper and lower bounds on the discrepancy that match within a factor, where is the ground set. In this work, we use the connection between factorization norms and discrepancy to improve their upper bound to be within a factor from the lower bound. We also generalize Fox, Xu, and Zhou's lower bound, and our upper bounds to arithmetic progressions in arbitrary convex bodies.