arXiv · 2611.16153
Enumerating Pyranim Isomorphisms
Abstract
We study a Nim-adjacent poset game, where chips are arranged in a pyramid and two players take turns removing chips that do not currently support chips to the upper-left and upper-right; upon removing this chip, all supported chips above are also removed. Play continues until the final chip is removed. We use a bijection between the game states, Dyck paths, and unit interval graphs to count the number of possible game states up to isomorphism.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yoav Binyamin, Evan Kniffen. 2026-11-12. Enumerating Pyranim Isomorphisms. https://searcharxiv.com/abs/2611.16153
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.