**Problem of the Week**

**Math Club**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

seminars:comb:abstract.201110bow

The Four-Color Theorem was first proved by Appel and Haken in 1977 with the aid of a computer. Later, a second proof was given by Robertson, Sanders, Seymour, and Thomas. While the proof was simplified, it still relies on a computer in a significant way.

In 1990, Kauffman proved that the Four-Color Theorem is equivalent to the ability to find a non-trivial assignment of the 3-dimensional unit vectors **i**, **j**, and **k** to the variables of two associations of the multiple cross product **v**_{1} × **v**_{2} × ··· × **v**_{n}, such that both associations have the same evaluation. (An assignment is *trivial* if it evaluates to zero.) The associations are determined by the map being colored.

Since elements of Thompson's group *F* represent instances of the associative law, one can prove that the Four-Color Theorem is equivalent to every element of *F*'s having a non-trivial assignment of the vectors **i**, **j**, and **k** for which that element's instance of associativity holds. I will prove that every positive element of *F* has such an assignment.

We call such elements *colorable*. I will consider several operations that preserve colorability of elements of *F*.

seminars/comb/abstract.201110bow.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported