Recent Comments

Recent Posts
 To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
 Nostalgia corner: John Riordan’s referee report of my first paper
 At the Movies III: Picture a Scientist
 At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
 And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
 Thomas Vidick: What it is that we do
 To cheer you up in difficult times 20: Ben Green presents superpolynomial lower bounds for offdiagonal van der Waerden numbers W(3,k)
 To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger cornerfree sets from better numbersontheforehead protocols
 Possible future Polymath projects (2009, 2021)
Top Posts & Pages
 To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
 The Argument Against Quantum Computers  A Very Short Introduction
 Possible future Polymath projects (2009, 2021)
 8866128975287528³+(8778405442862239)³+(2736111468807040)³
 TYI 30: Expected number of Dice throws
 Photonic Huge Quantum Advantage ???
 Jean
 ICM 2018 Rio (3)  Coifman, Goldstein, Kronheimer and Mrowka, and the Four Color Theorem
 Dan Romik on the Riemann zeta function
RSS
Monthly Archives: July 2013
LawlerKozdronRichardsStroock’s combined Proof for the MatrixTree theorem and Wilson’s Theorem
David Wilson and a cover of Shlomo’s recent book “Curvature in mathematics and physics” A few weeks ago, in David Kazhdan’s basic notion seminar, Shlomo Sternberg gave a lovely presentation Kirchhoff and Wilson via Kozdron and Stroock. The lecture is based on … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability
Tagged David Wilson, Gustav Kirchhoff, Trees
4 Comments
Auctionbased Tic Tac Toe: Solution
Reshef, Moshe and Sam The question: (based on discussions with Reshef Meir, Moshe Tennenholtz, and Sam Payne) Tic Tac Toe is played since anciant times. For the common version, where the two players X and O take turns in marking … Continue reading
Some old and new problems in combinatorics and geometry
Paul Erdős in Jerusalem, 1933 1993 Update: Here is a link to a draft of a paper* based on the first part of this lecture. Some old and new problems in combinatorial geometry I: Around Borsuk’s problem. I just came back from … Continue reading