English
Related papers

Related papers: A Conjecture about Periods in Subtraction Games

200 papers

Nim is a well-known combinatorial game with several variants, e.g., Delete Nim and Variant Delete Nim. In Variant Delete Nim, the player deletes one of the two heaps of stones and splits the other heap on his/her turn. In this paper, we…

Combinatorics · Mathematics 2023-01-31 Tomoaki Abuku , Ko Sakai , Masato Shinoda , Koki Suetsugu

A comply/constrain game or a game with a Muller twist is a game where the next player is allowed to place constraints on opponent's next move. We develop a closed form formula for the Grundy value of the single-pile subtraction game where…

Combinatorics · Mathematics 2018-06-05 Archishman Sravankumar

In this paper we prove the "Tiling implies Spectral" part of Fuglede's paper for the case of three intervals. Then we prove the "Spectral implies Tiling" part of the conjecture for the case of three equal intervals as also when the…

Classical Analysis and ODEs · Mathematics 2010-02-23 Debashish Bose , C. P. Anil Kumar , R. Krishnan , Shobha Madan

A setup is proposed to play a quantum version of the famous bimatrix game of Prisoners' Dilemma. Multi-slit electron diffraction with each player's pure strategy consisting of opening one of the two slits at his/her disposal are essential…

Quantum Physics · Physics 2009-11-07 A. Iqbal

We consider Schmidt's game on the space of compact subsets of a given metric space equipped with the Hausdorff metric, and the space of continuous functions equipped with the supremum norm. We are interested in determining the generic…

Metric Geometry · Mathematics 2021-03-26 Ábel Farkas , Jonathan M. Fraser , Erez Nesharim , David Simmons

A systematic framework for analyzing dynamical attributes of games has not been well-studied except for the special class of potential or near-potential games. In particular, the existing results have shortcomings in determining the…

Computer Science and Game Theory · Computer Science 2023-03-28 Sina Arefizadeh , Sadegh Arefizadeh , S. Rasoul Etesami , Sadegh Bolouki

Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning…

Logic in Computer Science · Computer Science 2015-07-01 Furio Honsell , Marina Lenisa

In this work, we discuss a number game that develops in a manner similar to that on which Gilbreath's conjecture on iterated absolute differences between consecutive primes is formulated. In our case the action occurs at the exponent level…

Number Theory · Mathematics 2014-11-06 Cristian Cobeli , Alexandru Zaharescu

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

Dynamical Systems · Mathematics 2018-06-20 Jarkko Kari , Etienne Moutot

We present a definition for the sum of a sequence of combinatorial games. This sum coincides with the classical sum in the case of a converging sequence of real numbers and with the infinitary natural sum in the case of a sequence of…

Combinatorics · Mathematics 2024-09-05 Paolo Lipparini

We propose a variant of Nim, named StrNim. Whereas a position in Nim is a tuple of non-negative integers, that in StrNim is a string, a sequence of characters. In every turn, each player shrinks the string, by removing a substring repeating…

Computer Science and Game Theory · Computer Science 2025-03-25 Shota Mizuno , Ryo Yoshinaka , Ayumi Shinohara

We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let $n\geq2$. Suppose a subset $\Omega$ of $n$-dimensional Euclidean space $\mathbb{R}^{n}$ satisfies…

Probability · Mathematics 2021-07-13 Steven Heilman

We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, which specifies the number of allowed splits a player can…

Combinatorics · Mathematics 2026-04-17 Antoine Dailly , Eric Duchene , Urban Larsson , Gabrielle Paris

Aim: Present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of…

Combinatorics · Mathematics 2016-09-06 Aviezri S. Fraenkel

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

Logic · Mathematics 2011-12-01 Luca Motto Ros

Let A be a finite subset of $\nat$. Then NIM(A;n) is the following 2-player game: initially there are $n$ stones on the board and the players alternate removing $a\in A$ stones. The first player who cannot move loses. This game has been…

Combinatorics · Mathematics 2015-11-13 William Gasarch , John Purtilo , Douglas Ulrich

Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melli\`es (2018) suggested that such categories of games and strategies may…

Logic in Computer Science · Computer Science 2018-10-17 Clovis Eberhart , Tom Hirschowitz , Alexis Laouar

I announce a solution of the conjecture about the measure of periodic points for planar billiard tables. The theorem says that if $\Om\subset\R^2$ is a compact domain with piecewise $C^3$ boundary, then the set of periodic orbits for the…

Dynamical Systems · Mathematics 2007-05-23 Eugene Gutkin

We present a general conjecture on the divisibility of a certain expression in terms of Kostka numbers and their close variants. This conjecture is closely related to a variant of the period-index problem of noncommutative algebra, with…

Combinatorics · Mathematics 2016-11-28 Arnav Tripathy

A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.

Combinatorics · Mathematics 2007-05-23 Mark van Hoeij
‹ Prev 1 3 4 5 6 7 10 Next ›