Yufei Zhao Efficient property testing of induced bipartite patterns in groups Abstract: Given a fixed "bipartite pattern", and a subset A of a vector space V over a finite field, we show that, by querying poly(1/epsilon) random elements of V, one can determine if A avoids the bipartite pattern or is epsilon-far from doing so. We prove the result by developing an efficient regularity lemma for subsets of groups satisfying a certain bounded VC dimension hypothesis. Joint work with Noga Alon and Jacob Fox