相关论文: Fractal Sequences and Restricted Nim

A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is…

A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…

One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…

We study the convergence of certain subseries of the harmonic series corresponding to increasing sequences of integers whose digits in a certain base are not uniformly distributed. We also discuss the case of irregular sequences, where the…

Fractals are self-similar recursive structures that have been used in modeling several real world processes. In this work we study how "fractal-like" processes arise in a prediction game where an adversary is generating a sequence of bits…

The restricted $(m,n;N)$-online Ramsey game is a game played between two players, Builder and Painter. The game starts with $N$ isolated vertices. Each turn Builder picks an edge to build and Painter chooses whether that edge is red or…

{\sc Yama Nim} is a variant of two piles {\sc Nim}. In this ruleset, the player chosses one of the piles and removes at least two tokens from the pile. In the same move, the player adds one token to the other pile. We show the winning…

The \emph{fractional matching preclusion number} of a graph $G$, denoted by $fmp(G)$, is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings. In this paper, we first give some sharp upper…

We study the periodicity of nim-sequences for subtraction games having subtraction sets with three elements. In particular, we give solutions in several cases, and we describe how these subtraction sets can be augmented by additional…

We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position…

In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues, priority queues, sets, linked lists, and binary trees. We…

Wythoff's Game is a variation of Nim in which players may take an equal number of stones from each pile or make valid Nim moves. W. A. Wythoff proved that the set of P-Positions (losing position), $C$, for Wythoff's Game is given by $C :=…

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…

Grundy functions have found many applications in a wide variety of games, in solving relevant problems in Game Theory. Many authors have been working on this topic for over many years. Since the existence of a Grundy function on a digraph…

In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a…

In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial games, where players have a finite number of options, there…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…

In this study, we study the relation between Grundy numbers of a Maximum Nim and Josephus problem. Let f(x) = floor(x/k), where floor( ) is the floor function and k is a positive integer. We prove that there is a simple relation with a…

The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…