
TL;DR
This paper introduces a novel single-player game based on planar binary rooted trees, connecting combinatorial mathematics with the four color conjecture through the Tamari poset and associahedron.
Contribution
It presents a new game framework linked to advanced combinatorial structures and explores its mathematical properties related to the four color conjecture.
Findings
Game based on planar binary rooted trees
Connection to the four color conjecture
Use of Tamari poset and associahedron in analysis
Abstract
We introduce a new one-person game similar to the Sudoku game. It is based on combinatorial objects called planar binary rooted trees. It is related to the four color conjecture. Its mathematical analysis makes use of the Tamari poset, hence the Stasheff associahedron.
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
TopicsDigital Games and Media · Sports Analytics and Performance
