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
Monthly Archives: September 2008
Extremal Combinatorics III: Some Basic Theorems
. Shattering Let us return to extremal problems for families of sets and describe several basic theorems and basic open problems. In the next part we will discuss a nice proof technique called “shifting” or “compression.” The Sauer-Shelah (-Perles -Vapnik-Chervonenkis) Lemma: (Here we write .) … Continue reading
New Haven (mainly pictures)
] Yale, New Haven I am back in New Haven which have become my home away from home in the last five years. Cappuccino’S and more – Cedar cross Congress, New Haven. Not only that this name is similar … Continue reading
Posted in Uncategorized
Tagged New Haven, Three dimensional electron microscopy, Yale, Yoel Shkolinsky
Leave a comment
Annotating Kimmo Eriksson’s Poem
“Start counting her NUMBER OF FACES,” Kimmo Eriksson, Brush up your Björner (2008). The time is right to annotate Kimmo Eriksson’s memorable poem: 1. What are Chip firing games? Many women will find it admirable if you tell her she … Continue reading
A Diameter Problem (5)
6. First subexponential bounds. Proposition 1: How to prove it: This is easy to prove: Given two sets and in our family , we first find a path of the form where, and . We let with and consider the family … Continue reading
Diameter Problem (4)
Let us consider another strategy to deal with our diameter problem. Let us try to associate other graphs to our family of sets. Recall that we consider a family of subsets of size of the set . Let us now associate … Continue reading
Diameter Problem (3)
3. What we will do in this post and and in future posts We will now try all sorts of ideas to give good upper bounds for the abstract diameter problem that we described. As we explained, such bounds apply … Continue reading
Posted in Combinatorics, Convex polytopes, Open problems
Tagged Hirsch conjecture, Linear programming, Quasi-automated proofs
1 Comment
Oded
I just heard the terrible news that Oded Schramm was killed in a hiking accident. Oded was hiking on Guye Peak near Snoqualmie Pass near Seattle. This is a terrible loss to Oded’s family, and our hearts and thoughts are … Continue reading
The Prisoner’s Dilemma, Sympathy, and Yaari’s Challenge
Correlation and Cooperation In our spring school devoted to Arrow’s economics, Menahem Yaari gave a talk entitled “correlation and cooperation.” It was about games as a model of people’s behavior, and Yaari made the following points: It is an empirical fact … Continue reading
Posted in Economics, Games, Philosophy, Rationality
Tagged Cooperation, Correlation, Prisoner dilemma
6 Comments