Recent Comments
-
Recent Posts
- Questions and Concerns About Google’s Quantum Supremacy Claim
- Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
- Test your intuition 52: Can you predict the ratios of ones?
- Amnon Shashua’s lecture at Reichman University: A Deep Dive into LLMs and their Future Impact.
- Mathematics (mainly combinatorics) related matters: A lot of activity.
- Alef Corner: Deep Learning 2020, 2030, 2040
- Some Problems
- Critical Times in Israel: Last Night’s Demonstrations
- An Aperiodic Monotile
Top Posts & Pages
- Questions and Concerns About Google’s Quantum Supremacy Claim
- Test your intuition 52: Can you predict the ratios of ones?
- An Aperiodic Monotile
- ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
- 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)
- About
- Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
- Gil Bor, Luis Hernández-Lamoneda, Valentín Jiménez-Desantiago, and Luis Montejano-Peimbert: On the isometric conjecture of Banach
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
13 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