Related papers: A Conjecture about Periods in Subtraction Games
Manin's Conjecture predicts the rate of growth of rational points of a bounded height after removing those lying on an exceptional set. We study whether the exceptional set in Manin's Conjecture is a thin set.
A conjecture regarding the structure of expander graphs is discussed.
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
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…
Iizuka's conjecture predicts that, given $m \in \mathbb{N}$ and a prime $p$, there exists infinitely many integers $n$ such that the class numbers of \textit{all} of the following quadratic number fields, \[ \mathbb{Q}(\sqrt{n}),\…
We apply the structure theory of finite dimensional algebras in order to deduce dimension formulas for spaces of period numbers, i.e., complex numbers defined by integrals of algebraic nature. We get a complete and conceptually clear answer…
A circular Nim game 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 k stacks. The last…
Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided…
We give a proof for $(2n + 1,n)$ and $(2n, n-1)$-periodic Ivrii's conjecture for planar outer billiards. We also give new simple geometric proofs for the 3 and 4-periodic cases for outer and symplectic billiards, and generalize for higher…
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the…
The game of Antonim is a variant of the game Nim, with the additional rule that heaps are not allowed to be the same size. A winning strategy for three heap Antonim has been solved. We will discuss the solution to three-heap Antonim and…
We obtain game-theoretic characterizations for meagerness and rareness of filters on a countable set.
Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…
We define a family of vertex colouring games played over a pair of graphs or digraphs $(G,H)$ by players $\forall$ and $\exists$. These games arise from work on a longstanding open problem in algebraic logic. It is conjectured that there is…
A lower bound for the number of 3-periodical billiard trajectories in a manifold embedded in Euclidean space is obtained.
We give lower bound on the number of periodic billiard trajectories inside a generic smooth strictly convex closed surface in 3-space: for odd n, there are at least 2(n-1) such trajectories. We apply a topological approach based on the…
Here, we observe that mean-field game (MFG) systems admit a two-player infinite-dimensional general-sum differential game formulation. We show that particular regimes of this game reduce to previously known variational principles.…
We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…
Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games. In this paper I…