Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Games and Complexes I: Transformation via Ideals (1310.1281v2)

Published 4 Oct 2013 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.