90 citations · 119 across the 9 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2017★ 2 cited
Szemerédi's theorem in the primes
Luka Rimanic, Julia Wolf
Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in…
math.NT2012★ 8 cited
Polynomial configurations in the primes
Thai Hoang Le, Julia Wolf
The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomia…
math.NT2007★ 90 cited
The true complexity of a system of linear equations
W. T. Gowers, J. Wolf
It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of…