Another simple reformulation of the four color theorem
Ajit Diwan

TL;DR
This paper presents a straightforward reformulation of the four color theorem using strings over a four-letter alphabet, offering a new perspective on this classic problem.
Contribution
It introduces a novel string-based reformulation of the four color theorem, simplifying its conceptual framework.
Findings
Reformulation as string problem over four-letter alphabet
Potential new approaches to prove the four color theorem
Simplification of the theorem's conceptual understanding
Abstract
We give a simple reformulation of the four color theorem as a problem on strings over a four letter alphabet.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · DNA and Biological Computing
