Games and Complexes I: Transformation via Ideals
classification
🧮 math.CO
keywords
complexesgamegamesplacementplayedsimplicialcombinatorialconsidered
read the original abstract
Placement games are a subclass of combinatorial games which are played on graphs. We will demonstrate that one can construct simplicial complexes corresponding to a placement game, and this game could be considered as a game played on these simplicial complexes. These complexes are constructed using square-free monomials.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.