Related papers: Unique Winning Opening Move in Three-Row Chomp

Chocolate-bar games are variants of the CHOMP game. A three-dimensional chocolate bar comprises a set of cubic boxes sized 1 X 1 X 1, with a bitter cubic box at the bottom of the column at position (0,0). For non-negative integers u,w such…

The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph $G$. If $xyz$ forms a path in $G$ and there are pegs on vertices $x$ and $y$ but not…

We reformulate the $3x+1$ conjecture by restricting attention to numbers congruent to $2$ (mod $3$). This leads to an equivalent conjecture for positive integers that reveals new aspects of the dynamics of the $3x+1$ problem. Advantages…

We study the injectivity property of certain actions of higher Chow groups on refined unramified cohomology. As an application for every $p\geq1$ and for each $d\geq p+4$ and $n\geq2,$ we establish the first examples of smooth complex…

In 1967, Chillingworth proved that all convex simplicial 3-balls are collapsible. Using the classical notion of tightness, we generalize this to arbitrary manifolds: We show that all tight simplicial 3-manifolds admit some perfect discrete…

The $(m,b)$ Maker-Breaker percolation game on $(\mathbb{Z}^2)_p$, introduced by Day and Falgas-Ravry, is played in the following way. Before the game starts, each edge of $\mathbb{Z}^2$ is removed independently with probability $1-p$. After…

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…

We introduce the following variant of the Gale-Berlekamp switching game. Let $P$ be a set of n noncollinear points in the plane, each of them having weight $+1$ or $-1$. At each step, we pick a line $\ell$ passing through at least two…

Two conjectures are presented. The first, Conjecture 1, is that the pushforward of a geometric distribution on the integers under $n$ Collatz iterates, modulo $2^p$, is usefully close to uniform distribution on the integers modulo $2^p$, if…

Sprout is a two-player pen and paper game which starts with $n$ vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-cubic planar at all times. The first player not being able…

We rigorously prove the existence of chaotic dynamics for the triopoly game model already studied, mainly from a numerical viewpoint, in the working paper by Naimzada and Tramontana [2011]. In the model considered, the three firms are…

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

We consider various probabilistic games with piles for one player or two players. In each round of the game, a player randomly chooses to add $a$ or $b$ chips to his pile under the condition that $a$ and $b$ are not necessarily positive. If…

The pole placement problem belongs to the classical problems of linear systems theory. It is often assumed that the ground field is the real numbers R or the complex numbers C. The major result over the complex numbers derived in 1981 by…

Let $P$ be a positive rational number. Call a function $f:\mathbb{R}\rightarrow\mathbb{R}$ to have $\textit{finite gaps property mod}$ $P$ if the following holds: for any positive irrational $\alpha$ and positive integer $M$, when the…

We propose a class of chess variants, Multimove Chess (i,j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent's king. All other rules of chess apply. We prove that if…

We study random walks on $\mathbb Z^d$ (with $d\ge 2$) among stationary ergodic random conductances $\{C_{x,y}\colon x,y\in\mathbb Z^d\}$ that permit jumps of arbitrary length. Our focus is on the Quenched Invariance Principle (QIP) which…

For positive integers $n, k, q, p$, let $A_k(n; q, p)$ be the largest integer $N$ such that there exists an edge coloring of $K_N^{(k)}$ with $q$ colors that does not contain a tight monotone path of length $n$ that consists of at most $p$…

In 1972 Tutte famously conjectured that every 4-edge-connected graph has a nowhere zero 3-flow; this is known to be equivalent to every 5-regular, 4-edge-connected graph having an edge orientation in which every in-degree is either 1 or 4.…

Walks in the plane taking unit-length steps north and east from $(0,0)$ to $(n,n)$ never dropping below $y=x$ and parking cars subject to preferences are two intriguing ingredients in a formula conjectured in 2005, now famously known as the…