A deformation of instanton homology for webs
The four color theorem from graph theory is certainly the most famous problem for which so far only a brute force computational proof exists. A new preprint of Kronheimer-Mrowka supports an approach towards this theorem via homology theories. Kronheimer. Mrowka: A deformation of instanton homology for webs, https://arxiv.org/pdf/1710.05002.pdf The four color theorem says that every … Continue reading "A deformation of instanton homology for webs"
