Recent Comments
David Román on Amazing: Erdős’ Unit Dis… David Román on Amazing: Erdős’ Unit Dis… David Román on The Ramanujan Challenge for… AI vyvrátila slavnou… on Amazing: Erdős’ Unit Dis… تحدي رامانوجان للذكا… on The Ramanujan Challenge for… mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … -
Recent Posts
- The Ramanujan Challenge for AI
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
Top Posts & Pages
- The Ramanujan Challenge for AI
- Amazing: Erdős' Unit Distance Problem was Disproved! It was achieved by AI!
- About
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus' blog)
- Attila Por's Universality Result for Tverberg Partitions
- Optimal Monotone Families for the Discrete Isoperimetric Inequality
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Moshe Vardi: What is Theoretical Computer Science?
- Polynomial Bounds for Chowla's Cosine Problem
RSS
Monthly Archives: July 2013
Lawler-Kozdron-Richards-Stroock’s combined Proof for the Matrix-Tree 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
Auction-based 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