Simplicial Complexes of Placement Games
| dc.contributor.author | Huntemann, Svenja | |
| dc.contributor.copyright-release | Not Applicable | en_US |
| dc.contributor.degree | Master of Science | en_US |
| dc.contributor.department | Department of Mathematics & Statistics - Math Division | en_US |
| dc.contributor.ethics-approval | Not Applicable | en_US |
| dc.contributor.external-examiner | n/a | en_US |
| dc.contributor.graduate-coordinator | Sara Faridi | en_US |
| dc.contributor.manuscripts | Not Applicable | en_US |
| dc.contributor.thesis-reader | Jason Brown | en_US |
| dc.contributor.thesis-reader | Peter Selinger | en_US |
| dc.contributor.thesis-reader | Sara Faridi | en_US |
| dc.contributor.thesis-reader | Richard Nowakowski | en_US |
| dc.contributor.thesis-supervisor | Sara Faridi, Richard Nowakowski | en_US |
| dc.date.accessioned | 2013-08-23T15:32:12Z | |
| dc.date.available | 2013-08-23T15:32:12Z | |
| dc.date.defence | 2013-08-15 | |
| dc.date.issued | 2013-08-23 | |
| dc.description.abstract | Placement games are a subclass of combinatorial games which are played on graphs. In this thesis, we demonstrate that placement games could be considered as games played on simplicial complexes. These complexes are constructed using square-free monomials. We define new classes of placement games and the notion of Doppelgänger. To aid in exploring the simplicial complex of a game, we introduce the bipartite flip and develop tools to compare known bounds on simplicial complexes (such as the Kruskal-Katona bounds) with bounds on game complexes. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10222/35472 | |
| dc.language.iso | en | en_US |
| dc.subject | Combinatorial Game Theory | en_US |
| dc.subject | Commutative Algebra | en_US |
| dc.subject | Combinatorial commutative algebra | en_US |
| dc.subject | Combinatorics | en_US |
| dc.subject | Simplicial Complex | en_US |
| dc.subject | Placement Game | en_US |
| dc.title | Simplicial Complexes of Placement Games | en_US |