Recent Comments
-
Recent Posts
- Ordinary computers can beat Google’s quantum computer after all
- Test Your Intuition 50. Two-Player Random Walk; Can You Detect Who Did Not Follow the Rules?
- ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
- ICM 2022: Langlands Day
- ICM 2022 awarding ceremonies (1)
- ICM 2022 Virtual Program, Live events, and Dynamics Week in Jerusalem
- Algorithmic Game Theory: Past, Present, and Future
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Igor Pak: How I chose Enumerative Combinatorics
Top Posts & Pages
- Ordinary computers can beat Google’s quantum computer after all
- Test Your Intuition 50. Two-Player Random Walk; Can You Detect Who Did Not Follow the Rules?
- Amazing: Feng Pan and Pan Zhang Announced a Way to "Spoof" (Classically Simulate) the Google's Quantum Supremacy Circuit!
- ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
- The Argument Against Quantum Computers - A Very Short Introduction
- Gil's Collegial Quantum Supremacy Skepticism FAQ
- Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
- Convex Polytopes: Seperation, Expansion, Chordality, and Approximations of Smooth Bodies
- The story of Poincaré and his friend the baker
RSS
Tag Archives: Open problems
Extremal Combinatorics I: Extremal Problems on Set Systems
The “basic notion seminar” is an initiative of David Kazhdan who joined HU math department around 2000. People give series of lectures about basic mathematics (or not so basic at times). Usually, speakers do not talk about their own research and not even … Continue reading
Combinatorics, Mathematics, Academics, Polemics, …
1. About: My name is Gil Kalai and I am a mathematician working mainly in the field of Combinatorics. Within combinatorics, I work mainly on geometric combinatorics and the study of convex polytopes and related objects, and on the analysis of Boolean functions … Continue reading