Logic Seminar
Anand Pillay
University of Notre Dame
Quasirandomness of definable subsets of definable groups in finite fields
Abstract: We prove an "arithmetic" version of Tao's algebraic regularity lemma about graphs uniformly definable in finite fields. Namely with uniformly
definable pairs $(G,A)$ ($G$ group, $A$ subset) in place of a graph. We make connections with Green's arithmetic regularity lemma for finite dimensional vector spaces over $F_p$, and
results of Gowers on quasirandom groups. (Joint with Atticus Stonestrom.)
Tuesday April 15, 2025 at 3:30 PM in 636 SEO