Recent Comments

Recent Posts
 Let me tell you about three of my recent papers
 Mathematical news to cheer you up
 To Cheer You Up in Difficult Times 28: Math On the Beach (Alef’s Corner)
 To cheer you up in difficult times 27: A major recent “Lean” proof verification
 To cheer you up in difficult times 26: Two reallife lectures yesterday at the Technion
 To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!
 To cheer you up in difficult times 25: some mathematical news! (Part 2)
 To cheer you up in difficult times 23: the original handwritten slides of Terry Tao’s 2015 Einstein Lecture in Jerusalem
 Alef Corner: ICM2022
Top Posts & Pages
 Let me tell you about three of my recent papers
 Mathematical news to cheer you up
 To cheer you up in difficult times 27: A major recent "Lean" proof verification
 The Argument Against Quantum Computers  A Very Short Introduction
 TYI 30: Expected number of Dice throws
 A sensation in the morning news  Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
 About
 Around Borsuk's Conjecture 1: Some Problems
 Sensitivity, Stability and Computation
RSS
Category Archives: Updates
Mathematical news to cheer you up
1. Anna Kiesenhofer, a PhD mathematician researching PDEs at Ecole Polytechnique Federale Lausanne (EPFL), won the gold medal in the women’s bicycle road race at the Olympics. Here are two trivia question: a) Which hero of a recent post over … Continue reading
Posted in Combinatorics, Sport, Uncategorized, Updates
5 Comments
To cheer you up in difficult times 27: A major recent “Lean” proof verification
“Lean is a functional programming language that makes it easy to write correct and maintainable code. You can also use Lean as an interactive theorem prover.” (See Lean’s homepage and see here for an introduction to lean.) Kevin Buzzard’s blog … Continue reading
Posted in Algebra, Updates, What is Mathematics
Tagged Kevin Buzzard, Lean, Peter Scholze
4 Comments
Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
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 … Continue reading
To cheer you up in difficult times 17: Amazing! The ErdősFaberLovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus have just uploaded a paper to the arXive, A proof of the ErdősFaberLovász conjecture. (I am thankful to Nati Linial and Ryan Alweiss for telling me about it.) … Continue reading
Posted in Combinatorics, Updates
Tagged Abhishek Methuku, Daniela Kühn, Deryk Osthus, Dong Yeap Kang, ErdosFaberLovasz conjecture, Tom Kelly
4 Comments
To cheer you up in difficult times 9: Alexey Pokrovskiy proved that Rota’s Basis Conjecture holds asymptotically
Pokrovskiy’s startling morning rainbow Rota’s Basis Conjecture holds asymptotically, by Alexey Pokrovskiy Abstract: Rota’s Basis Conjecture is a well known problem from matroid theory, that states that for any collection of n bases in a rank n matroid, it is … Continue reading
To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth’s theorem!
Thomas Bloom and Olof Sisask: Breaking the logarithmic barrier in Roth’s theorem on arithmetic progressions, arXiv:200703528 Once again Extraordinary news regarding Roth Theorem! (I thank Ryan Alweiss for telling me about it and Rahul Santhanam for telling me … Continue reading
To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
Here is a piece of news that will certainly cheer you up: Florian Richter found A new elementary proof of the prime number theorem. (I thank Tami Ziegler for telling me about the new result.) From left to right: Atle Selberg, … Continue reading
Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
Ringel’s conjecture solved (for sufficiently large n) A couple weeks ago and a few days after I heard an excellent lecture about it by Alexey Pokrovskiy in Oberwolfach, the paper A proof of Ringel’s Conjecture by Richard Montgomery, Alexey Pokrovskiy, … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Alexey Pokrovskiy, Benny Sudakov, Richard Montgomery
3 Comments
Two talks at HUJI: on the “infamous lower tail” and TOMORROW on recent advances in combinatorics
In this post I advertise my colloquium lecture tomorrow – Thursday 23/1/2020 14:30 – on recent advances in combinatorics, and also mention Wojtek Samotij’s lecture on our combinatorics seminar on The lower tail for triangles in random graphs. Click here … Continue reading
Posted in Combinatorics, Updates
Leave a comment