Fun with Algorithms proceedings, now online: https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16159

So if you want to read about robot bamboo trimmers, phase transitions in the mine density of minesweeper, applications of the Blaschke–Lebesgue inequality to the game of battleship, multiplication of base-Fibonacci numbers, or trains that can jump gaps in their tracks, you know where to go.

The conference itself has been rescheduled to next May. Maybe by then we can actually get a trip to an Italian resort island out of it.

Dynamic graph planarity testing, in Quanta: https://www.quantamagazine.org/a-new-algorithm-for-graph-crossings-hiding-in-plain-sight-20200915/

Original papers from SODA 2020, early this year: https://arxiv.org/abs/1910.09005 and from STOC 2020: https://arxiv.org/abs/1911.03449

Origametry: Mathematical Methods in Paper Folding (https://www.cambridge.org/us/academic/subjects/mathematics/recreational-mathematics/origametry-mathematical-methods-paper-folding), new book coming out October 31 by @tomhull

I haven't seen anything more than the blurb linked here and the limited preview on Google Books (https://books.google.com/books?id=LdX7DwAAQBAJ), but it looks interesting and worth waiting for.

New Combinatorics journal to watch

http://math.sfsu.edu/beck/ct/board.php

Intended to be a successor to JCTA. I hope they sort out a TLS certificate soon.

A prickly structure made of 70,000 reusable hexapod particles: https://www.thisiscolossal.com/2018/10/a-prickly-structure-made-of-70000-reusable-hexapod-particles/

Sort of like those seawalls they build by jumbling together giant concrete caltrops, only with pieces that are not quite so big and with usable spaces left void within it. Sometimes the article says "hexapod" and sometimes "decapod"; the pictures appear to show structures that mix two different kinds of particle.

Open is not forever: a study of vanished open access journals, https://arxiv.org/abs/2008.11933

This study shows the need for systematic archiving and redundant copying of online open journals, but I suspect that the problem for small hand-run print-based journals without much library pickup might be much worse. Via https://news.ycombinator.com/item?id=24422593 and https://www.sciencemag.org/news/2020/09/dozens-scientific-journals-have-vanished-internet-and-no-one-preserved-them

Rod Bogart's twitter feed is a blast. Here's his tweet announcing that he's made an hourglass that demonstrates Archimedes’ theorem that the volume of a cylinder is the sum of the volumes of its inscribed sphere and cone: https://twitter.com/RodBogart/status/455123609195802624

Peter Cameron gives a nice roundup of two recent online conferences on group theory and combinatorics that he attended more-or-less simultaneously (something that would have been impossible for physical conferences): https://cameroncounts.wordpress.com/2020/08/30/moonlighting/

The parts on synchronizing automata and twin-width particularly caught my attention as stuff I should look up and find out more about.

New blog post: Eberhard's theorem for bipartite polyhedra with one big face, https://11011110.github.io/blog/2020/09/07/eberhards-theorem-bipartite.html

Or, if you want to build a simple polyhedron given one \(2n\)-gon face and a fixed number of quadrilaterals, but an unlimited number of hexagons, what's the fewest hexagons you need to use?

Flamebait post of the day: Why mathematicians should stop naming things after each other, http://nautil.us/issue/89/the-dark-side/why-mathematicians-should-stop-naming-things-after-each-other

Via https://news.ycombinator.com/item?id=24385389 where for once the discussion is worth reading (main point: the alternative, using common English words to describe specialized technical concepts, can be even more confusing).

Ideal polyhedron (https://en.wikipedia.org/wiki/Ideal_polyhedron), a polyhedron in hyperbolic space with all vertices at infinity

Sylvester–Gallai theorem (https://en.wikipedia.org/wiki/Sylvester%E2%80%93Gallai_theorem), that every finite set of points in the Euclidean plane has a line that either passes through all of them or through exactly two of them

Both newly promoted to Good Article status on Wikipedia.

Lorenz Stöer's geometric landscapes: https://blog.graphicine.com/lorenz-stoer-geometric-landscapes/

In 2014 I linked a different page with a few of Stöer's 16th-century proto-surrealist combinations of landscape and geometry, but they were black and white. This one has more of them, in color.

based on a new preprint: On Polyhedral Realization with Isosceles Triangles, https://arxiv.org/abs/2009.00116

Closed quasigeodesics on the dodecahedron (https://www.quantamagazine.org/mathematicians-report-new-discovery-about-the-dodecahedron-20200831/), paths that start at a vertex and go straight across each edge until coming back to the same vertex from the other side. Original paper: https://arxiv.org/abs/1811.04131, https://doi.org/10.1080/10586458.2020.1712564

I saw this on Numberphile a few months back (video linked in article) but now it's on _Quanta_.

The Graph Drawing 2020 program is online: https://gd2020.cs.ubc.ca/program-no-links/

It is September 16-18, from 8AM to noon Pacific daylight time (the time in Vancouver, where the conference was originally to be held). The format has talk videos available pre-conference, with sessions consisting of 1-minute reminders of each talk and 5 minutes of live questions per talk. Jeff Erickson and Sheelagh Carpendale will give live invited talks.

It's free but requires registration, deadline September 10.

- Home page
- https://www.ics.uci.edu/~eppstein/

I'm a computer scientist at the University of California, Irvine, interested in algorithms, data structures, discrete geometry, and graph theory.

Joined Apr 2017