Results 1  10
of
27
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, preprint
"... Abstract. We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As an application we present a new (infinitary) proof ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
Abstract. We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As an application we present a new (infinitary) proof of the hypergraph removal lemma of NagleSchachtRödlSkokan and Gowers, which does not require the hypergraph regularity lemma and requires significantly less computation. This in turn gives new proofs of several corollaries of the hypergraph removal lemma, such as Szemerédi’s theorem on arithmetic progressions. 1.
The dichotomy between structure and randomness, arithmetic progressions, and the primes
"... Abstract. A famous theorem of Szemerédi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a fundamental dichotomy between structure and randomness ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract. A famous theorem of Szemerédi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a fundamental dichotomy between structure and randomness, which in turn leads (roughly speaking) to a decomposition of any object into a structured (lowcomplexity) component and a random (discorrelated) component. Important examples of these types of decompositions include the Furstenberg structure theorem and the Szemerédi regularity lemma. One recent application of this dichotomy is the result of Green and Tao establishing that the prime numbers contain arbitrarily long arithmetic progressions (despite having density zero in the integers). The power of this dichotomy is evidenced by the fact that the GreenTao theorem requires surprisingly little technology from analytic number theory, relying instead almost exclusively on manifestations of this dichotomy such as Szemerédi’s theorem. In this paper we survey various manifestations of this dichotomy in combinatorics, harmonic analysis, ergodic theory, and number theory. As we hope to emphasize here, the underlying themes in these arguments are remarkably similar even though the contexts are radically different. 1.
The ergodic and combinatorial approaches to Szemerédi’s theorem
, 2006
"... Abstract. A famous theorem of Szemerédi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the original combinatorial (and graphtheoretical) approac ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract. A famous theorem of Szemerédi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the original combinatorial (and graphtheoretical) approach of Szemerédi, the ergodic theory approach of Furstenberg, the Fourieranalytic approach of Gowers, and the hypergraph approach of NagleRödlSchachtSkokan and Gowers. In this lecture series we introduce the first, second and fourth approaches, though we will not delve into the full details of any of them. One of the themes of these lectures is the strong similarity of ideas between these approaches, despite the fact that they initially seem rather different. 1.
The metamathematics of ergodic theory
 THE ANNALS OF PURE AND APPLIED LOGIC
, 2009
"... The metamathematical tradition, tracing back to Hilbert, employs syntactic modeling to study the methods of contemporary mathematics. A central goal has been, in particular, to explore the extent to which infinitary methods can be understood in computational or otherwise explicit terms. Ergodic theo ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The metamathematical tradition, tracing back to Hilbert, employs syntactic modeling to study the methods of contemporary mathematics. A central goal has been, in particular, to explore the extent to which infinitary methods can be understood in computational or otherwise explicit terms. Ergodic theory provides rich opportunities for such analysis. Although the field has its origins in seventeenth century dynamics and nineteenth century statistical mechanics, it employs infinitary, nonconstructive, and structural methods that are characteristically modern. At the same time, computational concerns and recent applications to combinatorics and number theory force us to reconsider the constructive character of the theory and its methods. This paper surveys some recent contributions to the metamathematical study of ergodic theory, focusing on the mean and pointwise ergodic theorems and the Furstenberg structure theorem for measure preserving systems. In particular, I characterize the extent to which these theorems are nonconstructive, and explain how prooftheoretic methods can be used to locate their “constructive content.”
Generalising the HardyLittlewood method for primes
 In: Proceedings of the international congress of mathematicians
, 2007
"... Abstract. The HardyLittlewood method is a wellknown technique in analytic number theory. Among its spectacular applications are Vinogradov’s 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. The HardyLittlewood method is a wellknown technique in analytic number theory. Among its spectacular applications are Vinogradov’s 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the number of 3term progressions of primes, all less than N. This article surveys recent developments of the author and T. Tao, in which the HardyLittlewood method has been generalised to obtain, for example, an asymptotic for the number of 4term arithmetic progressions of primes less than N.
Obstructions to uniformity, and arithmetic patterns in the primes
, 2005
"... In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing in [26] that the primes contain arbitrarily long arithmetic progressions. One of the driving philosophies is to identify prec ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing in [26] that the primes contain arbitrarily long arithmetic progressions. One of the driving philosophies is to identify precisely what the obstructions could be that prevent the primes (or any other set) from behaving “randomly”, and then either show that the obstructions do not actually occur, or else convert the obstructions into usable structural information on the primes.
Long arithmetic progressions of primes
 Mathematics Proceedings
"... Abstract. This is an article for a general mathematical audience on the author’s work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. 1. introduction and history This is a description of recent work of the author and Terence Tao [11] on primes ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. This is an article for a general mathematical audience on the author’s work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. 1. introduction and history This is a description of recent work of the author and Terence Tao [11] on primes in arithmetic progression. It is based on seminars given for a general mathematical
FROM HARMONIC ANALYSIS TO ARITHMETIC COMBINATORICS
, 2006
"... We will describe a certain line of research connecting classical harmonic analysis to PDE regularity estimates, an old question in Euclidean geometry, a variety of deep combinatorial problems, recent advances in analytic number theory, and more. Traditionally, restriction theory is a part of classi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We will describe a certain line of research connecting classical harmonic analysis to PDE regularity estimates, an old question in Euclidean geometry, a variety of deep combinatorial problems, recent advances in analytic number theory, and more. Traditionally, restriction theory is a part of classical Fourier analysis that investigates the relationship between geometric and Fourieranalytic properties of singular measures. It became clear over the years that the theory would have to involve sophisticated geometric and combinatorial input. Two particularly important turning points were Fefferman’s work in the 1970s invoking the ”Kakeya problem” in this context, and Bourgain’s application of Gowers’s additive number theory techniques to the Kakeya problem almost 30 years later. All this led harmonic analysts to explore areas previously foreign to them, such as combinatorial geometry, graph theory, and additive number theory. Although the Kakeya and restriction problems remain stubbornly open, the