The Abel Lectures
Avi Wigderson, Professor at the School of Mathematics, Institute for Advanced Study, Princeton will be delivering this year's Science Lecture at the University of Oslo, on May 23rd. The lecture is called Randomness and pseudorandomness, and is one of four lectures to be held this day in connection with the Abel Prize week. The other speakers are Abel Laureate Endre Szemerédi, László Lovász and Timothy Gowers.
Avi Wigderson: Randomness and pseudorandomness:
Is the universe inherently deterministic or probabilistic? Perhaps more importantly - can we tell the difference between the two?
Humanity has pondered the meaning and utility of randomness for millennia.
There is a remarkable variety of ways in which we utilize perfect coin tosses to our advantage: in statistics, cryptography, game theory, algorithms, gambling... Indeed, randomness seems indispensable!
Which of these applications survive if the universe had no randomness in it at all? Which of them survive if only poor quality randomness is available, e.g. that arises from "unpredictable" phenomena like the weather or the stock market?
Pseudorandomness is the study, by mathematicians and computer scientists, of deterministic structures which share some properties of random ones.
Understanding pseudorandom objects and constructing them efficiently leads to a surprisingly positive answers to the questions above, namely that much can be done with poor quality randomness, of even without any randomness at all. I plan to explain key aspects of this theory, and mention some of Endre Szemeredi's contributions to pseudorandomness.
The talk is aimed at a general audience, and no particular background will be assumed.
Endre Szemerédi: In every chaos there is an order
The chaos and order will be defined relative to three problems.
1. Arithmetic progressions
This part is connected to a problem of Erdős and Turán from the 1930's. Related to the van der Waerden theorem, they asked if the density version of that result also holds:
Is it true that an infinite sequence of integers of positive (lower) density contains arbitrary long arithmetic progressions?
The first result in this direction was due to K. F. Roth, who proved that any sequence of integers of positive (lower) density contains a three-term arithmetic progression.
I will give a short history of the generalization of Roth's result and explain some ideas about the "easiest"" proof.
2. Long arithmetic progression in subset sums
I will give exact bound for the size of longest arithmetic progression in subset sums. In addition, I shall describe the structure of the subset sums, and give applications in number theory and probability theory.
3. Embedding sparse graphs into large graphs
László Lovász: The many facets of the Regularity Lemm
The Regularity Lemma of Szemeredi, first obtained in the context of his theorem on arithmetic progressions in dense seuqences, has become one of the most important and most powerful tools in graph theory. It is basic in
extremal graph theory and in the theory of property testing. Weaker versions with better bounds (Frieze and Kannan) and stronger versions (Alon, Fisher, Krivelevich and Szegedy) have been proved and used. However, the
significance of it goes way beyond graph theory: it can be viewed as statement in approximation theory, as a compactness result for the completion of the space of finite graphs, as a result about the dimensionality of a metric space associated with a graph, as a statement in information theory. It serves as the archetypal example of the dichotomy between structure and randomness as pointed out by Tao. Its extensions to hypergraphs, a difficult problem solved by Gowers and by Rodl, Skokan and Schacht, connects with higher order Fourier analysis.
Timothy Gowers: The afterlife of Szemerédi’s theorem
Szemerédi's theorem asserts that every set of integers of positive upper density contains arbitrarily long arithmetic progressions. This result has been extraordinarily influential, partly because of the tools that Szemerédi introduced in order to prove it, and partly because subsequent efforts to understand the result more fully have led to progress in many other areas of mathematics, including combinatorics, ergodic theory, harmonic analysis and number theory. I shall discuss some of these later developments, to which Szemerédi himself made several essential contributions.
The Abel Lectures
Location: Georg Sverdrups hus, Aud. 1, University of Oslo
23 May 2012 at 10:00 - 23 May 2012 at 15:15
10.00 Welome by Pro-Rector Inga Bostad, President of The Norwegian Academy of Science and Letters Nils Chr. Stenseth, and Chair of the Abel Committee Ragni Piene.
10.10 Professor Endre Szemerédi: "In Every Chaos There is an Order"
11.30 Professor László Lovász: The many facets of the Regularity Lemma"
12:30 Lunch (requires registration)
13.30 Professor Timothy Gowers: "The afterlife of Szemerédi's theorem"
14:30 Science Lecture: Avi Wigderson, "Randomness and Pseudorandomness"
15.15 Ending by Chair of the Abel Committee Ragni Piene
The Norwegian Academy of Science and Letters has decided to award the Abel Prize for 2014 to Yakov G. Sinai (78) of Princeton University, USA, and the Landau Institute for Theoretical Physics, Russian Academy of Sciences, "for his fundamental contributions to dynamical systems, ergodic theory, and mathematical physics". The President of the Norwegian Academy of Science and Letters, Nils Chr. Stenseth, announced the winner of the 2014 Abel Prize at the Academy in Oslo today, 26 March. Yakov G. Sinai will receive the Abel Prize from His Royal Highness The Crown Prince at an award ceremony in Oslo on 20 May.(25.03.2014) More
"On behalf of the American Mathematical society, it is a great pleasure to congratulate Yakov Sinai of Princeton University and the Landau Institute, recipient of the 2014 Abel Prize. Sinai's work has changed our understanding of change; his influence can be seen from number theory to physics. Congratulations!"(26.03.2014) More
The President of the Norwegian Academy of Science and Letters, Nils Chr. Stenseth, (picture) will announce the winner of the Abel Prize for 2014 at the Academy on the 26th of March. The Academy's choice of laureate is based on the recommendation of the Abel Committee. The chair of the Abel Committee, Ragni Piene, will give the reasons for the awarding of the prize. The internationally renowned mathematician Jordan Ellenberg will give a popular science presentation of the prize winner's work.(17.03.2014) More
The Abel Committee has embarked on the long journey in search of the next Abel Laureate. The committee which consists of five distinguished mathematicians has had its first meeting at the Norwegian Academy of Science and Letters in Oslo. Next stop will be St. Petersburg.(08.10.2013) More
38 Abel, Fields and Turing Laureates have confirmed their attendance at the 1st Heidelberg Laureate Forum (HLF), which takes place from September 22 until 27, 2013. The laureates will meet 200 of the most talented young researchers in the fields of mathematics and computer science from 47 countries. The three Abel Laureates who are attending are Sir Michael Atiyah, Endre Szemerédi and S. R. Srinivasa Varadhan.(04.09.2013) More