Jason (jcreed) wrote,
Jason
jcreed

I remembered this morning reading something about how the four-color theorem is equivalent to a certain peculiar "associativity" theorem about quaternions: that for any two parenthesizations of n variables, there is some assignment of unit quaternions i, j, k that in both parenthesizations makes no intermediate result 1.

Here is a visualization for n=8 of how many of these mutual assignments (which amount to edge 3-colorings of pairs of binary trees joined at the leaves, which is a little bit closer to cell 4-colorings of planar graphs):


Darker pixels mean more possible assignments. The 4-color theorem is the statement that throughout the triangle, it never gets completely white. Just think! If you could come up with a simple closed form description of this sort of diagram, you might have a nice short proof of 4CT.
Tags: math
Subscribe

  • (no subject)

    Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…

  • (no subject)

    Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…

  • (no subject)

    I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…

  • Post a new comment

    Error

    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

  • 11 comments

  • (no subject)

    Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…

  • (no subject)

    Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…

  • (no subject)

    I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…