Recent Comments

Recent Posts
 Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
 ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
 Test your intuition 47: AGCGTCTGCGTCTGCGACGATC? what comes next in the sequence?
 Cheerful news in difficult times: Richard Stanley wins the Steele Prize for lifetime achievement!
 Combinatorial Theory is Born
 To cheer you up in difficult times 34: Ringel Circle Problem solved by James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak
 Good Codes papers are on the arXiv
 To cheer you up in difficult times 33: Deep learning leads to progress in knot theory and on the conjecture that KazhdanLusztig polynomials are combinatorial.
 The Logarithmic Minkowski Problem
Top Posts & Pages
 The Argument Against Quantum Computers  A Very Short Introduction
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Reflections: On the Occasion of Ron Adin's and Yuval Roichman's Birthdays, and FPSAC 2021
 TYI 30: Expected number of Dice throws
 The Intermediate Value Theorem Applied to Football
 Zur Luria on the nQueens Problem
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Amazing: Karim Adiprasito proved the gconjecture for spheres!
 ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
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
13 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