arXiv Analytics

Sign in

arXiv:2412.18558 [math.CO]AbstractReferencesReviewsResources

A new way to prove configuration reducibility using gauge theory

Scott Baldridge, Ben McCarty

Published 2024-12-24Version 1

We show how ideas coming out of gauge theory can be used to prove configurations in the list of ``633 unavoidable configurations" are reducible. In this paper, we prove the smallest nontrivial example, the Birkhoff diamond, is reducible using our filtered $3$- and $4$-color homology. This is a new proof of a 111-year-old result that is a direct consequence of a special (2+1)-dimensional topological quantum field theory. As part of the proof, we introduce the idea of a state-reducible configuration. Because state-reducibility does not involve Kempe switches, this leads to an independent way to verify the proof of the four color theorem. We conjecture that these gauge theoretic ideas could also lead to a non-computer-based proof of it.

Related articles: Most relevant | Search more
arXiv:2211.17195 [math.CO] (Published 2022-11-30)
Gauge theory on graphs
arXiv:1207.5460 [math.CO] (Published 2012-07-23)
Properties of the corolla polynomial of a 3-regular graph
arXiv:2307.04740 [math.CO] (Published 2023-07-10)
On the image of graph distance matrices