Recent Comments
Category Archives: Geometry
To cheer you up in difficult times 25: some mathematical news! (Part 2)
Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP … Continue reading
Posted in Algebra, Combinatorics, Geometry, Number theory
2 Comments
Alef Corner: ICM2022
Alef’s new piece for ICM 2022 will surely cheer you up!
To cheer you up in difficult times 22: some mathematical news! (Part 1)
To cheer you up, in these difficult times, here are (in two parts) some mathematical news that I heard in personal communications or on social media. (Maybe I will write later, in more details, about few of them that are … Continue reading
Posted in Combinatorics, Convex polytopes, Convexity, Geometry
Leave a comment
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
Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
Stavros Argyrios Papadakis, Vasiliki Petrotou, and Karim Adiprasito In 2018, I reported here about Karim Adiprasito’s proof of the g-conjecture for simplicial spheres. This conjecture by McMullen from 1970 was considered a holy grail of algebraic combinatorics and it resisted … Continue reading
Posted in Algebra, Combinatorics, Geometry
Tagged g-conjecture, Hilda Geiringer, Karim Adiprasito, Stavros Argyrios Papadakis, Vasiliki Petrotou
5 Comments
Igor Pak: What if they are all wrong?
Originally posted on Igor Pak's blog:
Conjectures are a staple of mathematics. They are everywhere, permeating every area, subarea and subsubarea. They are diverse enough to avoid a single general adjective. They come in al shapes and sizes. Some…
Posted in Combinatorics, Computer Science and Optimization, Geometry, What is Mathematics
Tagged Igor Pak
7 Comments
Open problem session of HUJI-COMBSEM: Problem #5, Gil Kalai – the 3ᵈ problem
This post continues to describe problems presented at our open problems session back in November 2020. Here is the first post in the series. Today’s problem was presented by me, and it was an old 1989 conjecture of mine. A … Continue reading
To Cheer You Up in Difficult Times 15: Yuansi Chen Achieved a Major Breakthrough on Bourgain’s Slicing Problem and the Kannan, Lovász and Simonovits Conjecture
This post gives some background to a recent amazing breakthrough paper: An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture by Yuansi Chen. Congratulations Yuansi! The news Yuansi Chen gave an almost constant bounds for Bourgain’s … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Convexity, Geometry
Tagged Yuansi Chen
6 Comments
Recent progress on high dimensional Turan-Type problems by Andrey Kupavskii, Alexandr Polyanskii, István Tomon, and Dmitriy Zakharov and by Jason Long, Bhargav Narayanan, and Corrine Yap.
The extremal number for surfaces Andrey Kupavskii, Alexandr Polyanskii, István Tomon, Dmitriy Zakharov: The extremal number of surfaces Abstract: In 1973, Brown, Erdős and Sós proved that if is a 3-uniform hypergraph on vertices which contains no triangulation of the sphere, then … Continue reading
Open problem session of HUJI-COMBSEM: Problem #1, Nati Linial – Turan type theorems for simplicial complexes.
On November, 2020 we had a very nice open problem session in our weekly combinatorics seminar at HUJI. So I thought to have a series of posts to describe you the problems presented there. This is the first post in … Continue reading
