Recent Comments
-
Recent Posts
- My Notices AMS Paper on Quantum Computers – Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Updates from Cambridge
- Random Circuit Sampling: Fourier Expansion and Statistics
- Plans and Updates: Complementary Pictures
- Updates and Plans IV
- Three Remarkable Quantum Events at the Simons Institute for the Theory of Computing in Berkeley
- Yair Shenfeld and Ramon van Handel Settled (for polytopes) the Equality Cases For The Alexandrov-Fenchel Inequalities
- On the Limit of the Linear Programming Bound for Codes and Packing
Top Posts & Pages
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Navier-Stokes Fluid Computers
- My Notices AMS Paper on Quantum Computers - Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Updates and plans III.
- TYI 30: Expected number of Dice throws
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao's 2015 Einstein Lecture in Jerusalem
- Taking balls away: Oz' Version
RSS
Monthly Archives: April 2018
Testing *My* Intuition (34): Tiling High Dimension with an Arbitrary Low-Dimensional 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 Tree-Codes & Cancellations
The high-dimensional 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 two-dimensional 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, Graph-coloring
14 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
14 Comments
Conference on High Dimensional Combinatorics, April 22-26 2018
Conference on High Dimensional Combinatorics Conference home-page Dates: April 22-26, 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 Ein-Gedi
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 Epsilon-Nets with … Continue reading