ﻻ يوجد ملخص باللغة العربية
Let $S$ be a set of positive integers, and let $D$ be a set of integers larger than $1$. The game $i$-Mark$(S,D)$ is an impartial combinatorial game introduced by Sopena (2016), which is played with a single pile of tokens. In each turn, a player can subtract $s in S$ from the pile, or divide the size of the pile by $d in D$, if the pile size is divisible by $d$. Sopena partially analyzed the games with $S=[1, t-1]$ and $D={d}$ for $d otequiv 1 pmod t$, but left the case $d equiv 1 pmod t$ open. We solve this problem by calculating the Sprague-Grundy function of $i$-Mark$([1,t-1],{d})$ for $d equiv 1 pmod t$, for all $t,d geq 2$. We also calculate the Sprague-Grundy function of $i$-Mark$({2},{2k + 1})$ for all $k$, and show that it exhibits similar behavior. Finally, following Sopenas suggestion to look at games with $|D|>1$, we derive some partial results for the game $i$-Mark$({1}, {2, 3})$, whose Sprague-Grundy function seems to behave erratically and does not show any clean pattern. We prove that each value $0,1,2$ occurs infinitely often in its SG sequence, with a maximum gap length between consecutive appearances.
In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The makers goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to pr
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set. Simultaneously,
We give a new proof that any candy-passing game on a graph G with at least 4|E(G)|-|V(G)| candies stabilizes. (This result was first proven in arXiv:0807.4450.) Unlike the prior literature on candy-passing games, we use methods from the general theor
Given a family of graphs $mathcal{F}$, we define the $mathcal{F}$-saturation game as follows. Two players alternate adding edges to an initially empty graph on $n$ vertices, with the only constraint being that neither player can add an edge that crea
We discuss the tropical analogues of several basic questions of convex duality. In particular, the polar of a tropical polyhedral cone represents the set of linear inequalities that its elements satisfy. We characterize the extreme rays of the polar