Combinatorial Game Distributions of Steiner Systems
Yuki Irie

TL;DR
This paper explores the connection between combinatorial games and Steiner systems, constructing specific games whose P-position sets correspond to Steiner system blocks, and characterizing systems via game distributions.
Contribution
It introduces a method to construct games from Steiner systems, characterizes the hexad game among isomorphic systems, and links game distributions to properties of Steiner triple systems.
Findings
Characterized the hexad game as unique with minimal positions.
Developed a construction method for games from Steiner systems.
Linked game distribution symmetry to projective Steiner triple systems.
Abstract
The -position sets of some combinatorial games have special combinatorial structures. For example, the -position set of the hexad game, first investigated by Conway and Ryba, is the block set of the Steiner system in the shuffle numbering, . There were, however, few known games related to Steiner systems like the hexad game. For a given Steiner system, we construct a game whose -position set is its block set. By using constructed games, we obtain the following two results. First, we characterize among the 5040 isomorphic with point set . For each , our construction produces a game whose -position set is its block set. From , we obtain the hexad game, and this game is characterized as a unique game…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
