Linkage with feijoas
-
The season’s first feijoas (aka pineapple guavas) fell from the trees in my front garden (that’s how to tell they are ripe). They are the ones in the bowl on the right; other fruit included for scale (\(\mathbb{M}\)).
-
The image for the Wikipedia entry for The Dictionary of Old English (\(\mathbb{M}\)) is a modular origami rhombicosidodecahedron, made of discarded research material.
-
Academia.edu goes evil, and starts using member-provided research papers to generate AI podcasts, reviews, and the like, after changing its terms of use to grant itself the right to do anything it likes with your content, your face, your voice, your signature, and your identity.
-
Why you should be happy that you can use sin and cos in your web stylesheets (\(\mathbb{M}\), via), even though the State of CSS 2025 results listed them as “most hated feature”.
-
A question about splitting the sphere into 100 equal shapes (\(\mathbb{M}\)) leads to a different question: are there polyhedra with 100 hexagonal faces, six quadrilateral faces, and nothing else? Answer: yes. Here’s what it might look like inside of one, a square corridor of 100 hexagons capped at both ends by a strip of three quadrilaterals.
-
Meschers: geometry processing of impossible objects (\(\mathbb{M}\)). “Unlike a typical mesh, which stores per-vertex 3D positions, a mescher stores per-vertex 2D screen-space positions and a per-edge depth difference. Whereas differences in depth across edges must sum up to zero as we travel around a standard mesh, this is not necessarily the case for a mescher. It is a mathematical way of describing the perceptual impossibility.”
-
Accessible conferences and events (\(\mathbb{M}\)), with case studies and a checklist for what event organizers can do to make their conferences more accessible.
-
Another newly promoted Wikipedia Good Article: Euclid’s Elements (\(\mathbb{M}\)). You know, the ancient mathematics textbook.
-
Slides for my talk today at Graph Drawing, “Stabbing Faces By a Convex Curve (\(\mathbb{M}\)). The main result is that for every planar graph \(G\) and smooth convex curve \(C\) you can draw \(G\) so all its faces are crossed by \(C\). I wrote about this briefly in a recent blog post on a related topic, smooth curves with no convex arcs. The new talk slides are also fairly brief about the main result, instead going into more detail about its motivation in understanding what the shape of a point set tells you about the graphs that can be drawn planarly with its points as vertices.
-
Stoker’s conjecture proven by Cho & Kim (\(\mathbb{M}\)): every 3D polyhedron without partially-flat or collinear vertices is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting.
-
@n-gons and kids make a tensegrity table from popsicle sticks and twine.
-
Good advice for this year’s new university students: go to class, go to bed on time, do your homework, and ask others for help when you need it.
-
A new proof smooths out the math of melting (\(\mathbb{M}\)): Quanta on “On the multiplicity one conjecture for mean curvature flows of surfaces” by Bamler and Kleiner. Imagine melting a cylindrical piece of ice (like you get at many US restaurants). At some point melting will likely break through the cylinder, producing a crescent shape with two sharp points that gradually smooth as the ice continues to melt. That topology change is a singularity, where something discontinuous happens to the ice surface. If you somehow managed to keep your ice toroidal, the point when it becomes an infinitesimally thin ring and then vanishes would be a more complicated singularity.
Modeling continuously changing surfaces requires understanding their singularities. This paper is on a specific type of surface evolution called mean curvature flow, and shows that its unavoidable singularities (the ones you can’t eliminate by perturbing the starting surface) have only a few simple forms: like the kind where you break through a torus to produce two sharp points, unlike the kind where an infinitesimally thin ring vanishes or worse.
This is the same general area as the proof of the geometrization and Poincaré conjectures using Ricci flow. One difference is that mean curvature flow depends on how the given 2d surface is embedded in 3d; Ricci flow depends only on the intrinsic geometry of a surface, and not its embedding. Another difference is that this new work is on 2d surfaces, but the geometrization and Poincaré conjectures look one dimension higher, at 3d hypersurfaces. You can also look one dimension lower, at curves in the plane, where the mean curvature flow becomes the curve-shortening flow.