Linkage with many Wikipedia Good Articles
There are two reasons for the large number of Good Articles in this set. First, I had previously been trying to keep my nominations and reviews in balance, but there were too few nominations to review on topics of interest to me, and the inability to find things to review was preventing me from nominating other articles when they were ready. So I started nominating more often. And second, the Wikipedia Good Articles editors are having a drive this month to clean out old nominations, as they tend to do a couple of times per year.

Morphing fractal engraving vice jaws (\(\mathbb{M}\)). Circular arcs nested within circular arcs rotate to conform to whatever shape is being gripped.

Christian LawsonPerfect sets up a new wiki, Why start at \(x,y,z\)? (\(\mathbb{M}\)). Its aim is to collect ambiguous, inconsistent, or just plain unpleasant conventions in mathematical notation. My contribution: big O notation.

Pick’s theorem (\(\mathbb{M}\)). The area of a grid polygon equals its number of interior grid points, plus half the boundary points, minus one. Good Article #1.

The problem with combinatorics textbooks (\(\mathbb{M}\)). Igor Pak on the difficulty of teaching combinatorics in a comprehensive way in a single term. Instead, he suggests teaching courses on narrower subtopics: “the more specific you make the combinatorics course the more interesting it is to the students”.

I recently returned from a relaxing earlylongweekend minivacation to Avila Beach (\(\mathbb{M}\)), with seafood sunset beach dinners (the coast faces south so the sun sets over land), wine tasting (near the setting of Sideways), and sulphur springs hot tub soaks. The photo below is a garden in a field of rusted pylons in the flood basin of San Luis Obispo Creek. I liked its contrast of natural growth and regular artificial forms.

Viète’s formula (\(\mathbb{M}\)), an infinite product of nested roots evaluating to \(2/\pi\), “the first formula of European mathematics to represent an infinite process”. Good Article #2.

The New York Times on Erik and Marty Demaine’s mathematical typefaces (\(\mathbb{M}\), also, via).

Euclid–Euler theorem (\(\mathbb{M}\)). A 2milleniumlong collab in which Euclid proved that all Mersenne primes produce even perfect numbers, and Euler proved that all even perfect numbers come from Mersenne primes. But let’s not forget Ibn alHaytham (Alhazen), halfway between them in time, who conjectured Euler’s result but couldn’t prove it. Good Article #3.

Lyusternik’s book Convex Figures and Polyhedra (\(\mathbb{M}\)), one of the Mir translations from Russian to English, available without restrictions on archive.org.

Bucket queue (\(\mathbb{M}\)). This priority queue is a bit out of fashion, but good for small integer priorities or for shortest paths when the ratio of longest to shortest edge is small. Good Article #4, despite a reviewer who had somehow become convinced that deletion from doubly linked lists is nonconstant. The issue is offtopic but real: updating objects in data structures often needs the objects to track their location in the structure; for instance, changing priorities in a binary heap requires each object to know its index. Most introductory material on these topics and even some standard library implementations (like Python’s heapq) fail to address this complication.

Formalizing 100 theorems (\(\mathbb{M}\)). Freek Wiedijk uses a rather arbitrary collection of 100 favorite theorems from some 1999 web page as a benchmark set for the progress of automatic proof assistants. I’m sad that Pick’s theorem has seen so little love.

Greedy spanners in Euclidean spaces admit sublinear separators (\(\mathbb{M}\)). My SoCG’21 result with Hadi Khodabandeh that 2d greedy spanners have separators of size \(O(\sqrt{n})\) used crossingbased methods heavily dependent on planarity. This new preprint by Hung Le and Cuong Than uses different ideas to find separators of size \(O(n^{11/d})\), optimal in any dimension \(d\). Their work also extends from Euclidean spaces to doubling spaces.

Unique distancing (\(\mathbb{M}\)). How many points can you place in an \(n\times n\) grid so that all pairwise distances are distinct? The linked post concerns whether \(n\) points are possible (no for all but finitely many cases because there are too many pairs and too few sums of squares) but it also looks interesting to maximize the number of points.