activity
20092023
most citedAn theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions

114 citations · 1k across the 63 of their papers we have counts for

collaborators
Showing math.NTShow all

6 papers · 1 filter

math.NT2014★ 22 cited

The Green-Tao theorem: an exposition

David Conlon, Jacob Fox, Yufei Zhao

The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplific…

math.NT2013★ 7 cited

An arithmetic transference proof of a relative Szemerédi theorem

Yufei Zhao

Recently Conlon, Fox, and the author gave a new proof of a relative Szemerédi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the…

math.NT2013★ 6 cited

A short proof of the multidimensional Szemerédi theorem in the primes

Jacob Fox, Yufei Zhao

Tao conjectured that every dense subset of , the -tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and…

math.NT2013★ 2 cited

Linear forms from the Gowers uniformity norm

David Conlon, Jacob Fox, Yufei Zhao

This is a companion note to our paper 'A relative Szemerédi theorem', elaborating on a concluding remark. In that paper, we showed how to prove a relative Szemerédi theorem for $(r…

math.NT2013★ 59 cited

A relative Szemerédi theorem

David Conlon, Jacob Fox, Yufei Zhao

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemerédi th…

math.NT2009★ 28 cited

Sets Characterized by Missing Sums and Differences

Yufei Zhao

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an M…