305 – Projects

As mentioned before, I asked my 305 students to write a short paper as a final project. I am posting them here, with their permission; it is my hope that people will find them useful. There are some very nice papers here.

1. The 17 plane symmetry groups. By Samantha Burns, Courtney Fletcher, and Aubray Zell.
2. The Banach-Tarski paradox. By Josh Giudicelli, Chantel Kelly, and James Kunz.
3. The quaternions & octonions. By Kyle McAllister.
4. The pocket cube. By Mike Mesenbrink, and Nicole Stevenson.
5. 17 plane symmetry groups. By Anna Nelson, Holly Newman, and Molly Shipley.
6. The Banach-Tarski paradox and amenability. By Kameryn Williams.

305 – A brief update on n(3)

This continues the previous post on A lower bound for .

Only recently I was made aware of a note dated November 22, 2001, posted on Harvey Friedman‘s page, “Lecture notes on enormous integers”. In section 8, Friedman recalls the definition of the function , the length of the longest possible sequence from with the property that for no , the sequence is a subsequence of .

Friedman says that “A good upper bound for is work in progress”, and states (without proof):

Theorem. , where .

Here, are the functions of the Ackermann hierarchy (as defined in the previous post).

He also indicates a much larger lower bound for . We need some notation first: Let . Use exponential notation to denote composition, so .

Theorem. Let . Then .

He also states a result relating the rate of growth of the function to what logicians call subsystems of first-order arithmetic. A good reference for this topic is the book Metamathematics of First-order Arithmetic, by Hájek and Pudlák, available through Project Euclid.

There is a recent question on MathOverflow on this general topic.

305 – Derived subgroups of symmetric groups

One of the problems in the last homework set is to study the derived group of the symmetric group .

Recall that if is a group and , then their commutator is defined as

.

The derived group is the subgroup of generated by the commutators.

Note that, since any permutation has the same parity as its inverse, any commutator in is even. This means that .

The following short program is Sage allows us to verify that, for , every element of is actually a commutator. The program generates a list of the commutators of , then verifies that this list is closed under products and inverses (so it is a group). It also lists the size of this group. Note that the size is precisely , so in these 4 cases:

305 – Cube moves

Here is a small catalogue of moves of the Rubik’s cube. Appropriately combining them and their natural analogues under rotations or reflections, allow us to solve Rubik’s cube starting from any (legal) position. I show the effect the moves have when applied to the solved cube.

But, first, some relevant links:

• Rubik’s Cube World  Records. Here is the video to the current record.
• Lego Rubik’s Cube Solver. And the current mechanical record, the CubeStormer II.
• Thomas Rokicki, “Twenty-two moves suffice for Rubik’s Cube®“. Math. Intelligencer, vol 32 (1), (2010), 33–40.
• Exactly 20 moves are required: “God’s number is 20“. Moves are counted here in the Half-turn metric, where any turn on any face by any angle is one move.

305 – Homework V

This is the last homework set of the term. It is due Friday, April 27, 2012, at the beginning of lecture, but I am fine collecting it during dead week, if that works better.

305 – Homework IV

This homework set is due Wednesday, March 21, at the beginning of lecture.

305 – A potpurri of groups

Here are a few examples of groups and links illustrating some of them. I will be adding to this list; if you find additional links that may be useful or interesting, please let me know. A nice general place to look at is the page for the book “Visual group theory.”

• , the symmetric and alternating groups in letters.
• Abelian groups, such as .
• Dihedral groups. Here is Erin Carmody‘s page illustrating the symmetries of the square. The Wikipedia page on dihedral groups has additional illustrations and interesting examples.
• Braid groups. Patrick Dehornoy has done extensive research on braid groups, and his page has many useful surveys and papers on the topic. Again, the Wikipedia page is a useful introduction. The applet we saw in class is here.
• Matrix groups. For example, , the group of all invertible matrices with real entries, or , the group of all matrices with real entries and determinant 1.
• The plane symmetry (or Wallpaper) groups.
• Coxeter groups.
• Crystallographic groups.
• Any group is (isomorphic to) a group of permutations, but the groups corresponding to permutation puzzles are naturally described this way. For example, Dana Ernst recently gave a talk on this topic.

305 – The Futurama theorem

Here is a link to Dana Ernst talk on the Futurama theorem of Ken Keeler. In this version, products are just as we treat them (left to right). Also, in this version, there is the “try it yourself” exercise we did not do, but you may want to practice a few examples on your own anyway to make sure you understand the argument.

Another discussion of the Futurama theorem, by Samuel Coskey (who will be joining our math department starting this Fall) can be found here.

Finally, the questions mentioned at the end of Ernst’s talk (see here) are all interesting, and if you figure one or several of them out, please turn them in for extra credit.

(By the way, the same applies to all problems we have been discussing. For example, if through the term you figure a way of producing a really long sequence giving us a better bound for than what you obtained when the homework was due, please turn it in as well.)

305 – Campanology

Campanology, or bell ringing, is an English tradition, where a round of cathedral bells is rung by permuting their order. The book discusses some examples of the possible patterns used in practice (the Plain Lead on four bells, and the Plain Bob Minimus). Additional examples can be found in the Wikipedia link, and links are provided there to a few additional sites, such as bellringing.org.

I strongly recommend that you read Section 3.5 in the book dealing with this topic. It introduces through an example the useful notion of cosets, and also it is quite interesting. For example, it shows how several ideas from group theory were used in practice since the seventeenth century, predating the introduction of the concepts by Galois and his contemporaries, and in a completely different setting.

I did not know about this until I read the book, and of course now I see mentions of bell-ringing everywhere.

The quote above, for example, is from the book Combinatorial Set Theory by Lorenz Halbeisen.

A nice article on the topic (in French) can be found here; coincidentally, the article also talks at the end about juggling. The video of the talk on the mathematics of juggling by Allen Knutson that we saw an excerpt of today is here. A few technical and expository articles on this topic, by renown mathematician (and juggler) Ronald Graham, and his coauthors, can be found in Graham’s page. See for example here, here, here, and here.

305 – Homework III

This homework set is due Wednesday, February 29th, at the beginning of lecture, but feel free to turn it in earlier if possible. Recall that “show” means “prove”.