Recent Comments

Recent Posts
 To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
 To cheer you up in difficult times 4: Women In Theory present — I will survive
 To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
 Harsanyi’s Sweater
 To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
 Trees not Cubes! Memories of Boris Tsirelson
 A small update from Israel and memories from Singapore: Partha Dasgupta, Robin Mason, Frank Ramsey, and 007
 Game Theory – online Course at IDC, Herzliya
 TYI44: “What Then, To Raise an Old Question, is Mathematics?”
Top Posts & Pages
 To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
 To cheer you up in difficult times 4: Women In Theory present  I will survive
 TYI 30: Expected number of Dice throws
 Extremal Combinatorics VI: The FranklWilson Theorem
 Or Ordentlich, Oded Regev and Barak Weiss: New bounds for Covering Density!
 Game Theory 2020
 A sensation in the morning news  Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
 My Quantum Debate with Aram Harrow: Timeline, Nontechnical Highlights, and Flashbacks I
 Aubrey de Grey: The chromatic number of the plane is at least 5
RSS
Monthly Archives: April 2018
Testing *My* Intuition (34): Tiling High Dimension with an Arbitrary LowDimensional Tile.
Test your intuition 34 asked the following: A tile is a finite subset of . We can ask if can or cannot be partitioned into copies of . If can be partitioned into copies of we say that tiles . Here … Continue reading
Posted in Combinatorics, Test your intuition
Tagged Adam Chalcraft, Imre Leader, Ta Sheng Tan, Vytautas Gruslys
Leave a comment
My Copy of Branko Grünbaum’s Convex Polytopes
Branko Grünbaum is my academic grandfather (see this highly entertaining post for a picture representing five academic generations). Gunter Ziegler just wrote a beautiful article in the Notices of the AMS on Branko Grunbaum’s classic book “Convex Polytopes”, so this … Continue reading
Posted in Combinatorics, Convex polytopes, People
Tagged Branko Grunbaum, Dom de Caen, Günter Ziegler
4 Comments
Cohen, Haeupler, and Schulman: Explicit Binary TreeCodes & Cancellations
The highdimensional conference in Jerusalem is running with many exciting talks (and they are videotaped), and today in Tel Aviv there is a conference on Optimization and Discrete Geometry : Theory and Practice. Today in Jerusalem, Leonard Schulman talked (video available!) … Continue reading
Test Your Intuition (34): Tiling high dimensional spaces with twodimensional tiles.
A tile is a finite subset of . We can ask if can or cannot be partitioned into copies of . If can be partitioned into copies of we say that tiles . Here is a simpe example. Let consists of … Continue reading
Coloring Problems for Arrangements of Circles (and Pseudocircles)
To supplement and celebrate Aubrey de Grey’s result here are Eight problems on coloring circles A) Consider a finite family of unit circles. What is the minimum number of colors needed to color the circles so that tangent circles are … Continue reading
Posted in Combinatorics, Geometry, Open problems
Tagged Geometric combinatorics, geometric graphs, Graphcoloring
12 Comments
Aubrey de Grey: The chromatic number of the plane is at least 5
A major progress on an old standing beautiful problem. Aubrey de Grey proved that the chromatic number of the plane is at least 5. (I first heard about it from Alon Amit.) The Hadwiger–Nelson problem asks for the minimum number of … Continue reading
Posted in Combinatorics, Geometry, Open problems, Updates
Tagged Aubrey de Grey, The Hadwiger–Nelson problem
11 Comments
Conference on High Dimensional Combinatorics, April 2226 2018
Conference on High Dimensional Combinatorics Conference homepage Dates: April 2226, 2018 Place: Israel Institute for Advanced Studies, The Hebrew University of Jerusalem Organizers: Alex Lubotzky, Tali Kaufman and Oren Becker Registration form: click here Registration deadline: April 13, 2018 Combinatorics in general and the theory … Continue reading
Nathan Rubin Improved the Bound for Planar Weak εNets and Other News From EinGedi
I just came back from a splendid visit to Singapore and Vietnam and I will write about it later. While I was away, Nathan Rubin organized a lovely conference on topics closed to my heart ERC Workshop: Geometric Transversals and EpsilonNets with … Continue reading