Skip to content

A New Twist on Flexagons?

October 22, 2014


For Martin Gardner’s 100th birthday

Martin Gardner
Global Science source

Martin Gardner introduced many including myself to the joys of Discrete Mathematics. His glorious monthly column “Mathematical Games” for Scientific American included some continuous mathematics too, of course; one could say it was on “Concrete Mathematics.” However, I conjecture—based on a quick flip of the several books I own of his columns—that the symbols {\epsilon,\delta} in a calculus context never appeared in them.

Yesterday was the 100{{}^{th}} anniversary of Gardner’s birth. Dick and I wish to join the many others marking this centennial and thanking him for all he did to make math fun for so many.

His feature kicked off in 1956 with the famous column on hexaflexagons, which I will talk about in a moment. Gardner related in his autobiography, which was assembled three years after his death in 2010, how important this column was as his “break.” However, the column that made the most lasting impression on me began with the words:

The calculus of finite differences, a branch of mathematics that is not too well known but is at times highly useful, occupies a halfway house on the road from algebra to calculus.

This discrete “calculus” enables one to calculate a formula for any polynomial sequence {p(n)} given enough values for {n = 0,1,2,...} It also led to my favorite “visual proof” that {0^0 = 1}: For any integer {k > 0}, if you write out the powers {k^n} going across and take differences of adjacent values repeatedly to make an infinite equilateral triangle pointing down, the left side has the powers of {(k-1)}. Iterating this gives you the powers of {0}, but the entry for {k^0} as {k} counts down to {0} steadfastly remains {1}.

Tributes and Contributions

Tributes have been gathered all during this centennial year. Scientific American observed yesterday by posting a review of ten of Gardner’s most appreciated columns. Bill Gasarch’s post yesterday links to some of his and Lance Fortnow’s previous items on Gardner, and further to a site where anyone can contribute a testimonial.

Frederic Friedel, who co-founded the chess-database company ChessBase three decades ago, knew Gardner personally from 1979 as a fellow original member of the Committee for Scientific Investigation of Claims of the Paranormal (CSICOP, now CSI). The committee remains housed in my town of Amherst near Buffalo, now at the Center for Inquiry (CFI Western NY) which is across Sweet Home Road from my university campus. Friedel has described to me cold days in Buffalo and round tables with Carl Sagan and other luminaries. All this was before my own arrival in 1989.

Friedel was also among the column readers with whom Gardner interacted from the beginning in the 1950s. His awesome tribute yesterday includes appreciation of Gardner’s book Fads and Fallacies in the Name of Science, which also made a strong impression on me, and other links. Dick recalls the great chapter of that book that starts with Gardner saying that this next crazy claim cannot be disproved. It was that the universe was created recently with a full fossil record that makes it look much older. Indeed, it could be a so-called “Boltzmann Brain”—and a point made in this NY Times article is that it’s crazy that this is not crazy.

I never had any contact with Gardner, despite making a few visits to CFI; it ranks among numerous lost opportunities. I could mention many other influences from his columns, and looking through his book Mathematical Circus just now reminded me that his chapter on “Mascheroni Constructions” was my first knowledge of what I called the “class {\mathsf{NC}}” in my “STOC 1500″ post with Dick. I had a similar experience to what Douglas Hofstadter told in his own tribute in May 2010: I started off interested in Math+Physics, intending to take the latter as far as quantum mechanics and particles at Princeton. But I found advanced mechanics and electrodynamics tough going, and am ever grateful for being allowed to parachute out of the latter at midterm into Steve Maurer’s Discrete Mathematics course, in which I knew I’d found my métier. As I could have realized from my love of Gardner all along.

The Twist

I’ve wanted to make a post on my hexaflexagon twist when I had time to create nice pictures, but now I will have to make do by referring to the fine illustrations in Gardner’s original column, which is freely available from the M.A.A. here. It requires making the standard “hexa-hexa” as shown in Gardner’s Figure 2. For best effect, in addition to numbering the faces 1–6 as shown there (and using a solid color for each face), label the six components of each face A–F in the left-to-right order given there.

The “Twist” is always applicable from one of the three inner faces (1, 2, or 3); finding when it applies from one of the outer faces and from the configurations that follow is more of a challenge. Instead of flexing as shown in Figure 3, follow these directions:

  • Put your right thumb and forefinger on the two rightmost triangles (marked ‘2’ in the bottom part D of Figure 2 after the final flap with ‘1’ is folded to complete the flexagon), and put your left thumb and forefinger over the opposite two.

  • Fold the flexagon in half away from you, keeping the horizontal diameter toward you.

  • Then tease the bottom-left triangle and the bottom triangle toward you to open a bowl of four triangles, with your right thumb and forefinger now pinched together to make a flap that stands over the bowl.

  • Fold the flap over into the bowl, and then fold the bowl flat with the top point meeting the bottom point. You now have a lozenge of two triangles.

  • Flip the lozenge over so you can grab at the opposite point from the two that met.

  • You should be able to open from that point into another bowl of four triangles.

  • Then if you are lucky—at least 50% of the time until you learn the pattern for this always to succeed—you should be able to lift a flap out of the bowl.

  • Then close the bowl inversely to how you opened the other bowl, so that you again have a flexagon folded in half away from you, and grab at the opposite end to open it.

What you will get is a flexagon with the colors on its faces jumbled up. You will still be able to flex it the standard way, but only exposing one other face—that is, you will have something isomorphic to a tri-hexaflexagon.

Now the real fun is that you can iterate this process. For one thing, you can invert it to restore your original hexa-hexaflexagon. But you can also find other places from which to initiate another “Twist,” and these will lead to more tri-hexa configurations. Some will lump up thick wads of paper on three triangles of each face, so be ginger about it. Finally, after much exploration, you may come upon the “Dual Hexa.” This has six faces, in which the inner three alternate colors. It is, in fact, the configuration you would build if you first rotated the top part A of Gardner’s Figure 3 by 180 degrees. Then you may find a way to go from the primal to the dual and back by a long regular pattern of repeated twists.

As a high-school student in 1976, I attempted to map out the entire space of reachable configurations by hand, but made some bookkeeping errors and gave up. I wanted to write a computer program to simulate my twists, but did not make the time.

Open Problems

Can you do the “Twist”? The space of configurations you can explore is much larger than the “Tuckerman Traverse” of the standard hexa-hexa shown in Gardner’s Figure 4. Can you map it all out? Has anyone previously known about this?

[some format and word changes]

A New Provable Factoring Algorithm

October 18, 2014


Factoring, factoring, the whole day through, keeps on my mind—apologies to Hoagy Carmichael and Stuart Gorrell

MichaelRubinstein
Waterloo Mathematics source

Michael Rubinstein is an expert on number theory, who is on the faculty of the University of Waterloo. He is one of the organizers of a 61{^{st}}-birthday symposium being held December 15–19 in Princeton for my friend and former colleague, Peter Sarnak. I guess it is a matter of taste for a number theorist whether to observe a birthday with a lot of factors (60) or a prime (59 or 61). Rubinstein also does extensive experimental mathematics and lists several code libraries below his publications on his website, which also has interesting articles on the math, history, and practice of musical tuning.

Today Ken and I wish to discuss a paper of his on one of my favorite problems: integer factoring.
Read more…

TEDx Time In Buffalo

October 13, 2014


Our own Ken joins the team for TEDx

images

Adrienne Bermingham is the manager of this year’s TEDx Buffalo event, which will be held this Tuesday at the Montante Center of Canisius College in downtown Buffalo.

Today I wish to proudly announce that our own Ken Regan is one of the presenters at this year’s event.
Read more…

More on Testing Dyson’s Conjecture

October 11, 2014


Applying deep number theory to algorithms

AlanBakerLectern
FullWiki source

Alan Baker won the Fields Medal in 1970 for his work on algebraic and transcendental numbers. He greatly extended a theorem of Aleksandr Gelfond and Theodor Schneider which had solved the seventh problem on David Hilbert’s famous list. Baker’s extension says that if {\alpha_1,\dots,\alpha_k} are algebraic numbers other than {0} or {1}, and if {\beta_1,\dots,\beta_k} are irrational algebraic numbers that together with {1} are linearly independent over the rationals, then the product of {\alpha_i^{\beta_i}} for {i = 1} to {k} is transcendental. Hilbert had stated the {k=1} case, which Gelfond and Schneider solved, and believed it would be harder than the Riemann Hypothesis.

Today Ken and I want to talk about computing numbers to high precision and their relationship to our recent discussion of Freeman Dyson’s challenge. Read more…

How To Add Numbers

October 5, 2014


It’s harder than you think

Unknown

William Kahan is a numerical analyst and an expert on all things about floating point numbers. He won the 1989 Turing award for his pioneering work on how to implement floating point computations correctly. He has also been a tireless advocate for the care needed to avoid insidious numerical bugs, and his strong feelings come out in a 1997 interview for Dr. Dobbs’ Journal.

Today I want to talk about one of his results on how to sum a series of numbers.
Read more…

The Busy Beaver Problem

October 1, 2014


Can the impossible become practical?

TiborRado
Complex analysts gallery source

Tibor Radó was a mathematician who was the PhD advisor to a number of computer scientists. They include Shen Lin, Paul Young, and several others. All were his students while he was at Ohio State University. He is not the Rado of the Erdős-Ko-Rado theorem—that is Richard Rado, without an accent. Tibor Radó had an Erdős Number of 3, through Lin and then Ron Graham.

Today we want to continue to talk about the famous “Busy Beaver” problem which we mentioned in our discussion on the Microsoft SVC lab closing. Read more…

Microsoft Closes SVC

September 27, 2014


Some additional thoughts

OmerMSFT
Microsoft Research source

Omer Reingold is a brilliant researcher, and now all can see that he is also a very classy and thoughtful person. As you all know by now, he and many others have suddenly lost their jobs with the closing of Microsoft’s Silicon Valley Campus (SVC) Research Lab. The lab closed this week: it has been removed from Microsoft’s “Research labs worldwide” page. The closing affects about 50 jobs directly, and is part of an overall reduction of about 18,000 staff worldwide.

Today, Ken and I wish to express some of our feelings about this. At first we thought we could not add to what others have already said about the closing, but we realized we could still express support and add to the wider conversation.
Read more…

Follow

Get every new post delivered to your Inbox.

Join 1,881 other followers