An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs

Natan Rubin

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ i…