(Joint with Atticus Stonestrom.)

We give an "arithmetic" analogue of Tao's "algebraic regularity lemma", where the latter refers to a stronger Szemeredi graph regularity lemma for graphs uniformly definable in finite fields. We give a comparison to existing results on the quasirandomness of (subsets of) finite groups.