Szemeredi's theorem - 30 views
http://in-theory.blogspot.com/2006_05_28_archive.html in theory Saturday, June 03, 2006 Szemeredi's theorem Szemeredi's theorem on arithmetic progressions is one of the great triumphs of the "Hung...
I am hop
Group items tagged
math.NT/0610604: New bounds for Szemeredi's theorem, II: A new bound for r_4(N) - 0 views
-
Define r4(N) to be the largest cardinality of a set A ⊆ {1, . . . ,N} which does not contain four elements in arithmetic progression.
Timothy Gowers's web page - 0 views
A paper on the ArXiV « Gowers's Weblog - 0 views
-
The paper itself is called “Hypergraph regularity and the multidimensional Szemerédi theorem.” At the bottom level, the basic idea of the paper is due to Ruzsa, Szemerédi and Rödl. Ruzsa and Szemerédi started the ball rolling with a short and very clever argument that showed that Szemerédi’s famous theorem on arithmetic progressions, in the case of progressions of length 3, could be deduced from Szemerédi’s almost as famous regularity lemma, a remarkable result that allows any graph to be partitioned into a bounded number of pieces, almost all of which “behave randomly.”
Gowers' note for additive number theory - 0 views
-
I have proposed this course for the academic year 2006-7. The syllabus is Roth's theorem, the geometry of numbers, Freiman's theorem, quasirandomness of graphs and 3-uniform hypergraphs, and Szemerédi's regularity lemmaThe course will be examined as a 24
Fourier Analysis and Szemerédi's Theorem (ResearchIndex) - 0 views
-
-
there is a seminar on this things, ergodicpnt seminar in Beijing.
-
Szemerédi's regularity lemma revisited - 0 views
-
one views the regularity lemma not as a structure theorem for large dense graphs, but rather as a structure theorem for events or random variables in a product probability space.
[math/0512114] The dichotomy between structure and randomness, arithmetic progressions,... - 0 views
-
Rather than give another exposition of this result, we have chosen to take a broader view, surveying the collection of structural theorems which underlie the proof of such results as Theorem 1.1 and Theorem 1.2.
math.NT/0411246:Arithmetic progressions and the primes - El Escorial lectures - 0 views
-
This is an old article about Green-Tao's work(transference).
math.NT/0610050: The primes contain arbitrarily long polynomial progressions - 0 views
-
it is reasonable to conjecture that an analogous result to Theorem 1.3 also holds in higher dimensions.This is however still open even in the linear case, the key difficulty being that the tensor product of pseudorandom measures is not pseudorandom.
math.CO/0604456: The ergodic and combinatorial approaches to Szemerédi's theorem - 0 views
-
The combinatorial and ergodic approaches may seem rather different at first glance, but we will try to emphasise the many similarities between them.
1 - 19 of 19
Showing 20▼ items per page