拓扑研讨班：SO(3) representations and the four color theorem

中科院数学与系统科学研究院

数学研究所

学术报告

拓扑研讨班

报告人：  叶帆 博士 （剑桥大学）

题  目：SO(3) representations and the four color theorem

时  间：2022.04.20（星期三），14:30

地  点：数学院南楼N902室

摘  要：The four color theorem was proved by Appel and Haken in 1989 using a computer. At ICM 2018, Kronheimer and Mrowka proposed an alternative way based on gauge theory in low-dimensional topology that might give a new proof of this theorem. This talk is a survey of their approach. First, I’ll explain the relation between the SO(3) representation variety of a trivalent graph and the four color theorem. Then I’ll review some properties of singular instanton Floer homology J^# of a trivalent graph.