Related papers: Who Wins Domineering on Rectangular Boards?
Let $(X, \mathcal{F})$ be a hypergraph. The Maker-Breaker game on $(X, \mathcal{F})$ is a combinatorial game between two players, Maker and Breaker. Beginning with Maker, the players take turns claiming vertices from $X$ that have not yet…
We provide a criterion for determining the winner in two-player win-lose alternating-move games on trees, in terms of the Hausdorff dimension of the target set. We focus our study on special cases, including the Gale-Stewart game on the…
In combinatorics, a latin square is a $n\times n$ matrix filled with n different symbols, each occurring exactly once in each row and exactly once in each column. Associated to each latin square, we can define a simple graph called a latin…
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some…
Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game.…
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…
The aim of this paper is to prove a stronger version of a conjecture on the existence of non-dominated scalar-valued m-homogeneous polynomials (m>=3) on arbitrary infinite dimensional Banach spaces.
It is conjectured that the game domination number is at most $3n/5$ for every $n$-vertex graph which does not contain isolated vertices. It was proved in the recent years that the conjecture holds for several graph classes, including the…
Determining a Nash equilibrium in a $2$-player non-zero sum game is known to be PPAD-hard (Chen and Deng (2006), Chen, Deng and Teng (2009)). The problem, even when restricted to win-lose bimatrix games, remains PPAD-hard (Abbott, Kane and…
In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller)…
We introduce a new method for estimating the growth of various quantities arising in dynamical systems. We apply our method to polygonal billiards on surfaces of constant curvature. For instance, we obtain power bounds of degree two plus…
Consider the following probabilistic one-player game: The board is a graph with $n$ vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at random from all non-edges and is presented to the player,…
Circular Nim is a two-player impartial combinatorial game consisting of $n$ stacks of tokens placed in a circle. A move consists of choosing $k$ consecutive stacks and taking at least one token from one or more of the stacks. The last…
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite…
A positional game is a game where two players sequentially label vertices of a hypergraph, consisting of a board and a collection of winning sets, with colors assigned to each player until all vertices of the board are claimed. The first…
Berlekamp proposed a class of impartial combinatorial games based on the moves of chess pieces on rectangular boards. We generalize impartial chess games by playing them on Young diagrams and obtain results about winning and losing…
The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…
Online Ramsey game is played between Builder and Painter on an infinite board $K_{\mathbb N}$. In every round Builder selects an edge, then Painter colors it red or blue. Both know target graphs $H_1$ and $H_2$. Builder aims to create…
For any infinite field k and any positive integer r, we show constructively that the map sending each polynomial P $\in$ k[x] to its r-th iterate is dominant in various inductive limit topologies on the space of all polynomials.