Search arXivSearch

arXiv · 2408.02851

Wythoff's Nim with Finite Alterations

Abstract

Wythoff's Nim is a variant of 2-pile Nim in which players are allowed to take any positive number of stones from pile 1, or any positive number of stones from pile 2, or the same positive number from both piles. The player who makes the last move wins. It is well-known that the P-positions (losing positions) are precisely those where the two piles have sizes $\{\lfloor ϕn \rfloor, \lfloor ϕ^2n \rfloor \}$ for some integer $n\geq 0$, and $ϕ= (1+\sqrt{5})/2 = 1.6180\cdots$. In this paper we consider an altered form of Wythoff's Nim where an arbitrary finite set of positions are designated to be P or N positions. The values of the remaining positions are computed in the normal fashion for the game. We prove that the set of P-positions of the altered game closely resembles that of a translated normal Wythoff game. In fact the fraction of overlap of the sets of P-positions of these two games approaches $1$ as the pile sizes being considered go to infinity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirabel Hu, Daniel Sleator, William Tsin. 2024-08-07. Wythoff's Nim with Finite Alterations. https://arxiv.org/abs/2408.02851

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO