Related papers: Mis\`ere-play Hackenbush Sprigs
Given two graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the minimum integer $N$ such that any coloring of the edges of $K_N$ in red or blue yields a red $G$ or a blue $H$. Let $v(G)$ be the number of vertices of $G$ and $\chi(G)$ be the…
We study the two-matrix model which represents the sum over closed and open random surfaces coupled to an Ising Model. The boundary conditions are characterized by the fact that the Ising spins sitting at the vertices of the boundaries are…
We establish a translation dictionary between open and closed strings, starting from open string field theory. Under this correspondence, (off-shell) level-matched closed string states are represented by star algebra projectors in open…
We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates integrand reduction and global residue computations in a way very similar to using a Gr\"obner basis, but…
The mixed diamond chain is a frustrated Heisenberg chain composed of successive diamond-shaped units with two kinds of spins of magnitudes S and S/2 (S: integer). Ratio $lambda$ of two exchange parameters controls the strength of…
Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…
Fibonacci nim is a popular impartial combinatorial game, usually played with a single pile of stones. The game is appealing due to its surprising connections with the Fibonacci numbers and the Zeckendorf representation. In this article, we…
Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…
We identify a new type of paradoxical behavior in dice, where the sum of independent rolls produces a deceptive sequence of dominance relations. We call these ``anti-inductive dice". Consider a game with two players and two non-identical…
Given an integer partition of $n$, we consider the impartial combinatorial game LCTR in which moves consist of removing either the left column or top row of its Young diagram. We show that for both normal and mis\`ere play, the optimal…
We derive contributions to the trace formula for the spectral density accounting for the role of diffractive orbits in two-dimensional billiard systems with corners. This is achieved by using the exact Sommerfeld solution for the Green…
The $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move.…
We study a version of the lights out game played on directed graphs. For a digraph $D$, we begin with a labeling of $V(D)$ with elements of $\mathbb{Z}_k$ for $k \ge 2$. When a vertex $v$ is toggled, the labels of $v$ and any vertex that…
Stringy cosmology displays features that are different from standard cosmology. One may be surprised in that in this scenario there is no phase transition between the radiation dominated phase and matter dominated phase and the universe is…
A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave…
We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set…
Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair of arcs with the same color. In this paper we give the exact…
This paper studies a two-player nonzero-sum stochastic differential game governed by a controlled convection-diffusion stochastic partial differential equation (SPDE) with spatially heterogeneous coefficients. The diffusion and transport…
We consider the recently introduced knotting-unknotting game, in which two players take turns resolving crossings in a knot diagram which initially is missing all its crossing information. Once the knot is fully resolved, the winner is…
We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…