Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson

Combinatorics and more 2021-03-17

The Abel Prize was awarded earlier today to László Lovász and Avi Wigderson

“for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics.”

Congratulations to Laci and Avi, to their families, and to the communities of theoretical computer science and combinatorics. Let me quote one more sentence from the citation:

“They have both made fundamental contributions to understanding randomness in computation and in exploring the boundaries of efficient computation.”

For the full citation and more material see the Abel Prize page.

Avi and Laci, Oslo 2012. (source, Oberwolfach pictures)

Both Avi and Laci are frequently mentioned over my blog. The post Four derandomization problems is related to both. Here are a few posts on Laci: Posets and the perfect graph theorem; Building bridges II; ICM2010; Laci’s theorem about two families of sets (and subspaces); Building bridges I. On Avi: Fractional Sylvester Gallai; Avifest 1; Layish; Must-read book by Avi Wigderson ;Avi Wigderson’s: “Integrating computational modeling, algorithms, and complexity into theories of nature, marks a new scientific revolution!” (An invitation for a discussion.) There were also two posts on conjectures by Laci that were recently solved (almost completely): The EFL conjecture and the KLS conjecture.

I will not write today about computer science or mathematics but rather I will show you some pictures and give some links. (I will add most of the pictures later today.)

Here is the link to Building bridges II Laci’s 70th birthday conference. There were lectures by Noga Alon on Lovász, vectors, graphs and codes, by by Lex Schrijver On ϑ and Θ by Jennifer Chayes on Graphons and Graphexes as Limits of Sparse Graphs, by Santosh Vempala With or Without KLS by Avi Wigderson Mathematics and Computation (through the lens of one problem and one algorithm) by Eva Tardos on Small-loss bounds for online learning with partial information and many other inspiring lectures. (I linked here lectures directly related to Laci’s work.)

And here is a link to Avi’s 60th birthday conference: Avi Wigderson Is 60: A Celebration of Mathematics and Computer Science with lectures by Noga Alon on Avi, Graphs, and Communication, by Dorit Aharonov on Quantum Physics and the Computational Lens by Shafi Goldwasser on New Pseudo-deterministic Algorithms, by Nati Linial on Transitions and Phase Transitions by Alex Lubotzky on High Dimensional Expanders, by Laci Lovasz on What is generic? and also by Yuval Wigderson on Brains are Better Computers than Computers and by Einat Wigderson and me on Happy Days, and many other inspiring talks.

Trivia questions:

Who are these people? (1,2,3,4,5)