A weak regularity lemma for polynomials
Provides a new tool for polynomial decomposition with quantitative bounds, enabling progress on problems in arithmetic circuit complexity and additive combinatorics that were previously intractable.
The paper introduces a weak regularity lemma for polynomials with strong bounds, avoiding tower-type blowups, and uses it to derive new results on arithmetic circuits and polynomial ranks, including improved bounds on circuit size and top fan-in of depth-4 formulas.
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming of having tower-type bounds or worse. In this paper we design a new, weaker regularity lemma with strong bounds. The new regularity lemma in particular provides means for quantitatively studying the curves contained in the image of a polynomial map, which is beyond the reach of standard methods. The weak regularity lemma turns out to be powerful enough to yield results on arithmetic circuits and polynomial ranks that may be of independent interest: - A general upper bound on the arithmetic circuit size of low-degree polynomials based solely on their image. - An upper bound on the top fan-in of depth-4 arithmetic formulas under similar conditions. - A quantitative bound for the Green-Tao notion of rank for polynomials, significantly improving on a result of Karam.