🤓of the day(ish): László Lovász

Lovász is one of greatest combinatorics researchers of this century, shocking he didn't win a Fields Medal. His work stretches from the LLL lattice algorithm (attacking lattice crypto), Lovász local lemma (quantitative Borel-Cantelli lemma), and graphons https://i.imgur.com/Oimp

ヽ(⌐■_■)ノ♪♬ @ @gauntlet/🤖Ventures/tldr/Aera \\ ¯\_(ツ)_/¯ Struggling with the nature of randomness \\ main: @gaa \\ /red-bull /defi-research maxi

Lovász is insanely versatile: from basic combinatoric results (optimal covers and LP rounding), to probability results (both LLLs), and results involving limits of finite objects (graphons). Graphons look like functional analysis, whereas combinatorial results are algebraic — rare for a top mathematician to do both

Also the Kannan-Lovász-Simonovits conjecture on high-dimensional convex bodies!

Once had the privilege of attending a talk by Avi Wigderson, another absolute legend