-
Linkage from Toronto
Last time I did one of these posts I was in Montreal for the 3rd Joint SIAM/CAIMS Annual Meetings (AN) and its satellite conferences on geometric design (GD) and applied and computational discrete algorithms (ACDA). This time, I’m back in Canada for the Algorithms and Data Structures Symposium (WADS) and Canadian Conference on Computational Geometry (CCCG). Yes, only some of those acronyms make sense. Anyway:
-
Linkage from Montreal
- 3-colouring planar graphs (\(\mathbb{M}\)), new preprint by Dujmović, Morin, Norin, and Wood showing that one can assign three colors to the vertices of any \(n\)-vertex planar graph in such a way that each monochromatic component has \(O(n^{4/9})\) vertices, improving a previous \(O(n^{1/2})\) bound. The best lower bound known is \(\Omega(n^{1/3})\).
-
Twenty years of blogging
I made my first post to this blog twenty years ago, on July 20, 2005.
-
Linkage
- Dozens of the world’s most cited scientists stop falsely claiming to work in Saudi Arabia (\(\mathbb{M}\)). Perhaps relatedly, Clarivate has tightened its checks for fraudulent citation practices and removed a greatly expanded number of researchers from its highly cited researcher lists.
-
Ready lists
Beginning computer science students learn about stacks, queues, and priority queues, different ways of organizing and ordering a collection of tasks to be performed. But more basic than any of those, and less frequently taught and formalized, is the ready list, a collection of tasks to be performed whose ordering is not important. All it needs to do is to allow new tasks to be added to the collection and to find and remove an arbitrary task from the collection.
-
Geometric street art in Kanazawa
Kanazawa was this year’s host of Computational Geometry Week and the Symposium on Computational Geometry, and a great place to visit for lots of reasons. One of the lesser reasons is that it also hosts an interesting collection of geometric street art, some of which I photographed on my recent visit.
-
Linkage
- Robin Houston dissects the outer shell of a \(4\times 4\times 4\) polycube into seven interlocked pieces, picking up from a 2023 discussion where I found a six-piece solution. With bonus short video by George Miller showing that, with round enough cubes, it makes a nice snap-together puzzle.
-
Linkage with pelicans
- ViXra launches archive of AI-generated papers (\(\mathbb{M}\)). In case your daily dose of crankpottery needed supercharging.
-
Two recent preprints
I have two new(ish) arXiv preprints that I thought I would announce together here rather than devoting a separate post to each of them.
-
Linkage
- Anti-inductive dice (\(\mathbb{M}\)). One player rolling \(n\) copies of one die is more likely to win than the other player rolling \(n\) copies of the other die, except when \(n=4\).
subscribe via RSS