Combinatorial Stacks and the Four-Colour Theorem

Details Combinatorial Stacks and the Four-Colour Theorem Combinatorial Stacks and the Four-Colour Theorem

2005-01-14

arxiv.org/abs/math/0501231v1

Mathematics

Combinatorics

12 pages; uses AMS macros and xypic

Scientific paper

We interpret the number of good four-colourings of the faces of a trivalent, spherical polyhedron as the 2-holonomy of the 2-connection of a fibered category, phi, modeled on Rep(sl(2)) and defined over the dual triangulation, T. We also build an sl(2)-bundle with connection over T, that is a global, equivariant section of phi, and we prove that the four-colour theorem is equivalent to the fact that the connection of this sl(2)-bundle vanishes nowhere. This interpretation may be a first step toward a cohomological proof of the four-colour theorem.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Stacks and the Four-Colour Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Stacks and the Four-Colour Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Stacks and the Four-Colour Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88049