Recent Comments
-
Recent Posts
- 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
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Noga Alon and Udi Hrushovski won the 2022 Shaw Prize
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
Top Posts & Pages
- Algorithmic Game Theory: Past, Present, and Future
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- The Argument Against Quantum Computers - A Very Short Introduction
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Combinatorics, Mathematics, Academics, Polemics, ...
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- TYI 30: Expected number of Dice throws
- Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectation-thresholds
RSS
Tag Archives: Combinatorics
Where were we?
I was slow blogging, and catching up won’t be so easy. Of course, this brings me back to the question of what I should blog about. Ideally, I should tell you about mathematical things I heard about. The problem is … Continue reading
Important formulas in Combinatorics
Another spin-off of the Noga-poster-formula-competition is a MathOverflow question: Important formulas in combinatorics. The question collects important formulas representing major progress in combinatorics. So far there are 31 formulas and quite a few were new to me. There are several areas … Continue reading
Amazing: Peter Keevash Constructed General Steiner Systems and Designs
Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of q-subsets from an n-element set X set so that every r-subset of X is included in precisely λ sets in the collection? … Continue reading
Posted in Combinatorics, Open problems
Tagged Combinatorics, Designs, Oberwolfach, Peter Keevash
16 Comments
Jerusalem Combinatorics ’93
Jerusalem Combinatorics ’93 is the title of a conference I organized that took place fifteen years ago in May 9-17, 1993 at the Hebrew University of Jerusalem. It was a conference that was devoted to all areas of combinatorics. The other … Continue reading
Posted in Combinatorics, Conferences, Women in science
Tagged Combinatorics, Conferences, Jerusalem, Women in science
Leave a comment
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