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
- Combinatorics, Mathematics, Academics, Polemics, ...
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- TYI 30: Expected number of Dice throws
- Game Theory 2021
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
RSS
Monthly Archives: July 2011
In how many ways you can chose a committee of three students from a class of ten students?
The renewed interest in this old post, reminded me of a more recent event: Question: In how many ways you can chose a committee of three students from a class of ten students? My expected answer: which is 120. Alternative … Continue reading
Posted in Mathematics to the rescue, Riddles, Teaching
1 Comment
Joe’s 100th MO question
MathOverflow is a remarkable recent platform for research level questions and answers in mathematics. Joe O’Rourke have asked over MO wonderful questions. (Here is a link to the questions) Many of those questions can be the starting point of a research … Continue reading
Posted in Mathematics over the Internet, Open problems
Tagged Joseph O'Rourke, Mathoverflow, planetMO
5 Comments
A Couple Updates on the Advances-in-Combinatorics Updates
In a recent post I mentioned quite a few remarkable recent developments in combinatorics. Let me mention a couple more. Independent sets in regular graphs A challenging conjecture by Noga Alon and Jeff Kahn in graph theory was about the number of … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Independent sets in graphs, Roth's theorem
4 Comments