@jsiehler Unfortunately I don't understand enough German to appreciate this.

A triangulated polygon, from Les Amusemens Mathématiques by André-Joseph Mancoucke, 1749. This is the earliest appearance I know of the theorem (stated without proof) that every simple polygon can be triangulated by diagonals. In particular, Mancoucke predates both Meister's (1770) and Poinsot's (1809) seminal treatises on polygons.

Numberphile 15-minute video on Dehn invariants: https://www.youtube.com/watch?v=eYfpSAxGakI

The Dehn invariant is a value derived from a polyhedron that doesn't change if you cut up the polyhedron into smaller polyhedral pieces and rearrange them into a different polyhedron. It's 0 for the cube and nonzero for other Platonic solids, proving that they can't be cut and rearranged into a cube. See https://en.wikipedia.org/wiki/Dehn_invariant for more, in somewhat more technical detail than the video.

Leiden wall formulas: http://muurformules.nl/

The last time I was in Leiden they were decorating the exterior walls of all their buildings with poems of many different languages. Now they've moved on to the language of mathematics.

@pschwede If all else fails you could encode whatever you're trying to represent as a binary string, and then encode that string as a long path with leaves attached to some path vertices to represent 1's and with path vertices that have no attached leaf representing 0's. That's a very special case of a bipartite graph. If you want your typed graph to look more like a graph you could use this kind of tree-binary representation just for the types, attached to each vertex of a larger graph.

@pschwede Closest I can think of is https://en.wikipedia.org/wiki/Gadget_(computer_science)

Essentially, you want to use small recognizable parts of your bipartite graph to simulate parts of whatever other structure you're trying to simulate.

@pschwede "Typed" with what sort of type system? But in some sense the answer is always yes: bipartite graphs are complicated enough to encode whatever information you want. How direct the encoding might be is a different question.

New blog post "Connectivity and finiteness in modal graph logic", https://11011110.github.io/blog/2019/07/13/connectivity-finiteness-modal.html

Inspired by Joel David Hamkins’ recent blog post on modal model theory (http://jdh.hamkins.org/modal-model-theory/), I look at how one can express some basic graph properties in this kind of logic.

Trávník's smooth self-referential formula: http://jtra.cz/stuff/essays/math-self-reference-smooth/index.html

via https://twitter.com/johncarlosbaez/status/1141376710551601152

It is actually a linked set of formulas, described in a typeset image, that when plotted as described in the image produces the image itself. It follows the same ideas as earlier self-referential formulas like https://en.wikipedia.org/wiki/Tupper%27s_self-referential_formula but unlike them describes a smooth vector image based on splines instead of a pixelated bitmap.

Very quick video tutorial on how to make the Miura-ori fold, by Polly Verity: https://www.instagram.com/p/ByH-R4Ql-NA/

via https://www.thisiscolossal.com/2019/07/new-polly-verity/

Modal model theory: http://jdh.hamkins.org/modal-model-theory/

For graphs, this extends first order logic (where the only quantification is over vertices and the only predicate is adjacency) with operators \(\Box\) and \(\Diamond\): \(\Box(F)\) is true when all supergraphs model \(F\) and \(\Diamond(F)\) is true when at least one supergraph models \(F\).

This can express nontrivial graph properties like \(k\)-colorability, and comes in two variants depending on whether you can quantify outside the operators.

Evoboxx, a retro-styled portable device that does only two things: run Conway's Game of Life and generate sounds from it. Not very practical in these days of cell phones but then maybe that's what makes it a fun project. https://boingboing.net/2019/07/08/check-out-this-cool-synthesize.html

This week I'm in Milan for the Symposium on Geometry Processing, https://sgp2019.di.unimi.it/

They have an official twitter stream, mostly consisting of event photos: https://twitter.com/geometryprocess

So far the sightseeing highlight of my trip has been seeing pages of Da Vinci's Codex Atlanticus at the Ambrosian Library. For online copies of some of it, see https://www.ambrosiana.it/en/discover/codex-atlanticus/

A formula for designing lenses with no spherical aberration: https://petapixel.com/2019/07/05/goodbye-aberration-physicist-solves-2000-year-old-optical-problem/

This seems to have little practical value as there was already a numerical solution, and I don't think it handles chromatic aberration, but it's interesting that there is an analytic formula for these shapes.

The other day I was thinking about graphs that have degree sequence 1,3,3,3,... such graphs can't be bipartite, so I was wondering whether it is possible for such a graph to have no even cycle. It turns out that graphs with no even cycle have at most (3n-3)/2 edges (I think), whereas my graphs have exactly (3n-2)/2 edges!

See also https://www.metafilter.com/181768/We-dont-need-no-stinkin-edumaction for more discussion and links

Chinese scientists guilty of ‘researching while Asian’ in Trump’s America: https://www.scmp.com/magazines/post-magazine/long-reads/article/3016267/chinese-scientists-guilty-researching-while

via https://news.ycombinator.com/item?id=20319936

The story focuses on star cancer researcher Xifeng Wu (https://en.wikipedia.org/wiki/Xifeng_Wu), forced to resign from the University of Texas, apparently because she fostered collaboration with Chinese cancer research institutions at the behest of her higher administration.

See also "The U.S. Is Purging Chinese Cancer Researchers From Top Institutions", https://www.bloomberg.com/news/features/2019-06-13/the-u-s-is-purging-chinese-americans-from-top-cancer-research

@anne @christianp Wikipedia says the members of this field are called the constructible numbers: https://en.wikipedia.org/wiki/Constructible_number

You can also call it the quadratic closure of the rationals.

The annual Great Internet Math-off is happening at @blog — view and vote on your favorites!

So far we've had commutativity of log-exponentiation vs weather infovis (https://aperiodical.com/2019/07/the-big-internet-math-off-2019-group-1-alex-corner-vs-lucy-rycroft-smith/), the geometry of the Sydney Opera House vs straight lines on a donut (https://aperiodical.com/2019/07/the-big-internet-math-off-2019-group-2-marianne-rachel-vs-vincent-pantaloni/), multiplication tables and muffins (https://aperiodical.com/2019/07/the-big-internet-math-off-2019-group-3-vicky-neale-vs-jim-propp/) and a video on shapes in La Sagrada Familia (shot on location?!) vs an intro to fractals (https://aperiodical.com/2019/07/the-big-internet-math-off-2019-group-4-colin-beveridge-vs-kyle-d-evans/). More daily for roughly a month.

U.Alaska budget gutted by 40%: https://www.insidehighered.com/quicktakes/2019/06/28/huge-budget-cut-university-alaska

https://www.chronicle.com/article/Unprecedented-in-Our/246596

https://www.npr.org/2019/07/03/738569508/university-of-alaska-readies-for-budget-slash-we-may-likely-never-recover

From the Chronicle story, the total amount cut over the past five years (including this new biggest cut) is more like 63%, from $522M to $192M. And from the NPR story, the likely response is to close one of its three main campuses and all 13 smaller community campuses.

Ironically, the cause is right-wing insistence on a universal basic income of $3000/person from fuel extraction revenues.

- 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