A base-p Sprague-Grundy type theorem for p-calm subtraction games: Welter's game and representations of generalized symmetric groups

TL;DR

This paper introduces p-calm subtraction games and establishes a generalized Sprague-Grundy theorem involving p-Nim-sums, connecting combinatorial game theory with representations of symmetric groups.

Contribution

It extends the Sprague-Grundy theorem to p-calm subtraction games using p-Nim-sums and links Welter's game to representations of generalized symmetric groups.

Findings

Sprague-Grundy function of p-saturation equals p-Nim-sum of components

Welter's game is p-calm, enabling the generalization

Connection between Welter's game and symmetric group representations

Abstract

For impartial games $\Gamma$ and $\Gamma'$, the Sprague-Grundy function of the disjunctive sum $\Gamma + \Gamma'$ is equal to the Nim-sum of their Sprague-Grundy functions. In this paper, we introduce $p$-calm subtraction games, and show that for $p$-calm subtraction games $\Gamma$ and $\Gamma'$, the Sprague-Grundy function of a $p$-saturation of $\Gamma + \Gamma'$ is equal to the $p$-Nim-sum of the Sprague-Grundy functions of their $p$-saturations. Here a $p$-Nim-sum is the result of addition without carrying in base $p$ and a $p$-saturation of $\Gamma$ is an impartial game obtained from $\Gamma$ by adding some moves. It will turn out that Nim and Welter's game are $p$-calm. Further, using the $p$-calmness of Welter's game, we generalize a relation between Welter's game and representations of symmetric groups to disjunctive sums of Welter's games and representations of generalized symmetric groups; this result is described combinatorially in terms of Young diagrams.