The primes contain arbitrarily long polynomial progressionsĮrrata: Acta Math. The ergodic and combinatorial approaches to Szemer\'edi's theoremĬentre de Recerches Math\'ematiques, CRM Proceedings and Lecture Notes Vol. Product set estimates in noncommutative groupsĪ correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma The dichotomy between structure and randomness, arithmetic progressions, and the primes Quadratic uniformity of the M\"obius functionĪnnales de l’Institut Fourier 58 (2009), 1863-1935. New bounds for Szemeredi's Theorem, III: A polylog bound for r_4(N) Vaughan, eds, Cambridge University Press, 2009. New bounds for Szemeredi's Theorem, II: A new bound for r_4(N)Īnalytic number theory: essays in honour of Klaus Roth, W. Inverse Littlewood-Offord theorems and the condition number of random discrete matrices 2 (2006), 199-217 Ĭompressions, convex geometry, and the Freiman-Bilu theorem Obstructions to uniformity, and arithmetic patterns in the primes Random symmetric matrices are almost surely non-singular d’Analyse Mathematique 99 (2006), 109-176Īn inverse theorem for the Gowers $U^3(G)$ normĪ variant of the hypergraph removal lemma The Gaussian primes contain arbitrarily shaped constellations On the singularity probability of random Bernoulli matrices Random Structures and Algorithms 28 (2006), 1-23.Ĭollectanea Mathematica (2006), Vol. On random $\pm 1$ matrices: Singularity and Determinant Journal de Théorie des Nombres de Bordeaux 18 (2006), 137-172Ī quantitative ergodic theory proof of Szemer\'edi's theoremĮlectron. Restriction theory of the Selberg Sieve, with applications New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries The primes contain arbitrarily long arithmetic progressions Math 254A home page - Arithmetic combinatorics (2003) Papers, and projects close to completionĪ sum-product estimate for finite fields, and applications Preprints in additive combinatorics and number theory
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |