Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Binyamin, Yoav, Kniffen, Evan
Institution: Texas A&M University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: Dyck paths, unit interval graphs, bijections
Open Access status: green
OpenAlex ID: W7225985749
