|
|
Additive Combinatorics with a view towards Computer Science and Cryptography An
– Khodakhast Bibak
- 2011
|
|
9
|
The ergodic and combinatorial approaches to Szemerédi’s theorem
– Terence Tao
- 2006
|
|
29
|
A quantitative ergodic theory proof of Szemerédi’s theorem
– Terence Tao
- 2004
|
|
18
|
An inverse theorem for the Gowers U 3 norm
– Ben Green, Terence Tao
- 2005
|
|
1
|
What is good mathematics?
– Terence Tao
- 2007
|
|
4
|
A simple regularization of hypergraphs
– Yoshiyasu Ishigami
|
|
|
Convergence of multiple . . .
– BERNARD HOST
- 2006
|
|
5
|
Obstructions to uniformity, and arithmetic patterns in the primes, preprint
– Terence Tao
|
|
16
|
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, preprint
– Terence Tao
|
|
|
DECOMPOSITIONS, APPROXIMATE STRUCTURE, TRANSFERENCE, AND THE HAHN-BANACH THEOREM
– W. T. Gowers
- 811
|
|
38
|
A variant of the hypergraph removal lemma
– Terence Tao
- 2006
|
|
|
ON A TWO–DIMENSIONAL ANALOG OF SZEMER ÉDI’S THEOREM IN ABELIAN GROUPS
– I. D. Shkredov
- 705
|
|
11
|
Norm convergence of multiple ergodic averages for commuting transformations
– Terence Tao
- 2007
|
|
9
|
On sets of integers not containing long arithmetic progressions, unpublished. Available at http://www.arxiv.org/pdf/math.CO/0108155
– Michael T. Lacey
|
|
|
On sets of integers not containing long arithmetic progressions
– Izabella Łaba, Michael T. Lacey
- 2001
|
|
3
|
Finding Large 3-free Sets I: The Small n Case
– William Gasarch , James Glenn , Clyde P. Kruskal
- 2007
|
|
2
|
Arithmetic progressions and the primes - El Escorial lectures
– Terence Tao
|
|
12
|
A new proof of the density Hales-Jewett theorem
– D. H. J. Polymath
- 2009
|
|
18
|
On exchangeable random variables and the statistics of large graphs and hypergraphs
– Tim Austin
- 2008
|
