On a truncated icosahedron / buckyball / Telstar-style soccer ball, consider two adjacent hexagons and the two pentagons that are adjacent to both. These four faces can be removed, rotated by a right angle, and reattached, causing only a small change to the overall shape. Most fullerenes have at least one such patch.

If I ever get around to making more printable models of fullerenes, I would omit those that can be changed, by the above twist, into one of higher symmetry. I have a pretty good idea of how I’d go about listing the fullerenes and finding their siblings; but I do not have a grip on distinguishing symmetry groups of the same order – e.g., that of the regular tetrahedron versus that of a hexagonal prism – and a subgroup of one may not be a subgroup of the other.

So I got out An Atlas of Fullerenes in the hope of understanding how they did it – and happened to open to a chapter I had not looked at before, which covers the Stone-Wales transformation (for so it is named) and lists, up to C₅₀ (15 hexagons), which fullerenes change with which.

The 812 smallest fullerenes are thus cut to 72 in 47 families. The biggest of these families has six remaining members, four with C2v symmetry (one axis of twofold rotation, and a reflection plane containing that axis) and two with C3 symmetry (chiral with one threefold axis). Their symmetry numbers are 4 and 3 respectively, but as C3 is not a subgroup of C2v I keep them all.

Surprisingly the ten families of C₅₀ include two with no nontrivial symmetry at all.

I wrote:

each curve hits alternate dots: first exactly, then with offsets pushing it toward the other curve.

I don’t think I’ve mentioned here how the offsets work. ( . . more . . )

For context, see past posts in the curve-fitting category that I just created. To recap:

The curves I’ve been drawing are the paths made by a point moving at constant speed at an angle which is a piecewise quadratic function of path length. Curvature, the first derivative of angle, is continuous.

Such a path that hits a given sequence of dots is fully determined if it loops, but otherwise it has two degrees of freedom. For any angle and curvature at the starting dot, there is a quadratic coefficient that lets the path reach the next node, and likewise for the next.

My current code starts with an estimate for the length of each segment (between two dots) and the angle at its midpoint, and uses these basis functions to fit those angles: a constant, a linear function, and a family of “solitons”: piecewise quadratics, zero outside a sequence of four dots, discontinuous in the second derivative at each of those dots. For n segments, there are n-2 solitons, so the constant and linear functions are needed to consume the last two degrees of freedom.

Eventually I noticed a flaw in this scheme: the curvature of the resulting path is the same at both ends, namely the slope of the linear component, because the solitons contribute nothing to it. That’s appropriate for ‘C’, but wrong for plenty of other strokes; in ‘S’ the end curvatures ought to have opposite sign.

The next thing I’ll try is a least-squares quadratic fit to the whole sequence, then fit the residues with solitons as before. That should be an improvement but it’s not ideal; curvature is a local feature. Perhaps I’ll think of something better later.

Here, each curve hits alternate dots: first exactly (above), then with offsets pushing it toward the other curve. Below is the result of eight iterations.

With enough iterations, the top of ‘s’ eventually gets a more symmetrical arch, as the change in curvature is spread more evenly.

But many runs get stuck in the fitting phase, and I don’t yet know why. Attacking one likely flaw didn’t help.

(Previously: 2014, 2011, 2010; also, less closely related, 2015)

I tried to smoothen a stroke by shifting each dot toward the Euler spiral (aka clothoid, aka Cornu spiral) determined by its four nearest neighbors. That didn’t work so well: small wiggles were removed, but big ones were magnified.

( . . more . . )

In 2007 I thought of a pretty way to paint a square so that all pixels are different, but similar colors are clustered. For each pixel, set x,y to its coordinates; if their sum is odd, set the low bit of one of the color channels to 1. Replace x,y with (-x+y)>>1, (-x-y)>>1; this has the effect of rotating the grid by 3/8 turn and shrinking it by a factor of √2, so that the former even points, which formed a larger oblique grid, now fall on the original grid, and the odd points have their new half-coordinates truncated away. Repeat until a bit has been assigned to each bit of the three color channels.

Colors that match in their higher bits form twindragon fractals, thus:

In 2012, I thought: what if the rotation alternates clockwise and counterclockwise?

A bit on the boring side.

But in 2017, I thought: what if the sequence of left and right turns is randomized? ( . . more . . )

Two-fifths of the links in my sphere arrangements page were broken. Ouch! I found new addresses for a few of them, and used the Wayback Machine for the rest.