Ramsey Games

From MaRDI portal





The Ramsey game R(\(\alpha\),\(\tau\),\(\beta)\) is as follows: two players White and Black alternately pick previously unchosen members of \([\alpha]^{\tau}\). White moves at limit stages and the game ends when \([\alpha]^{\tau}\) is exhausted. White wins if \(\exists A\subset \alpha,\quad tpA=\beta\) with \([A]^{\tau}\subseteq W\) where W is the set of White's choices; otherwise Black wins. To say a player wins R(\(\alpha\),\(\tau\),\(\beta)\) means he has a winning strategy. The game \(R(\alpha,<\tau,\beta)\) is defined anologously. R(\(\alpha\),\(\tau\),\(\beta)\) and \(R(\alpha,<\tau,\beta)\) are game theoretic versions of the partition relations \(\alpha \to (\beta)_ 2^{\tau}\) and \(\alpha \to (\beta)_ 2^{<\tau}\) respectively. The authors prove several results about these games, e.g., if \(2^{\kappa}=\kappa^+\) then Black wins \(R(\kappa^+,2,\kappa^+),\) if \(\kappa\) is a strong limit cardinal then White wins R(\(\kappa\),2,\(\kappa)\); if \(\kappa \to (\beta)_ 2^{\omega}\) holds for a limit ordinal \(\beta\) then White wins \(R(\kappa,<\omega,\beta).\) This last result occasions the definition of sequoia which the authors hope will have a life of its own.











This page was built for publication: Ramsey Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344198)