

Effective bounds for polynomial systems defined over the rationals - lecture 2
De Teresa Krick


Effective bounds for polynomial systems defined over the rationals - lecture 1
De Teresa Krick
De Anand Pillay
Apparaît dans la collection : Model Theory and Applications to Groups and Combinatorics / Théorie des modèles et applications en théorie des groupes et en combinatoire
We give an arithmetic version of Tao's algebraic regularity lemma (which was itself an improved Szemerédi regularity lemma for graphs uniformly definable in finite fields). In the arithmetic regime the objects of study are pairs $(G, D)$ where $G$ is a group and $D$ an arbitrary subset, all uniformly definable in finite fields. We obtain optimal results, namely that the algebraic regularity lemma holds for the associated bipartite graph $(G, G, E)$ where $E(x, y)$ is $x y^{-1} \in D$, witnessed by a the decomposition of $G$ into cosets of a uniformly definable small index normal subgroup $H$ of $G$.