相关论文: On factorisations of Left dead ends

We find the misere monoids of normal-play canonical-form integer and non-integer numbers. These come as consequences of more general results for the universe of `dead-ending' games. Left and right `ends' have previously been defined as…

The universe $\mathcal{E}$ of dead-ending partizan games has emerged as an important structure in the study of mis\`ere play. Here we attempt a systematic investigation of the structure of $\mathcal{E}$ and its subuniverses. We begin by…

Combinatorial games are played under two different play conventions: normal play, where the last player to move wins, and \mis play, where the last player to move loses. Combinatorial games are also classified into impartial positions and…

Milley and Renault proved an interesting characterisation of invertible elements in the dead-ending universe: they are the games with no subpositions of outcome $\mathscr{P}$ (the '$\mathscr{P}$-free' games). We generalise their approach to…

We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied…

We consider the abstract structure of the monoid M of mis\`ere impartial game values. Several new results are presented, including a proof that the group of fractions of M is almost torsion-free; a method of calculating the number of…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Given a morphism from an affine semigroup Q to an arbitrary commutative monoid, it is shown that every fiber possesses an affine stratification: a partition into a finite disjoint union of translates of normal affine semigroups. The proof…

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

Absolute Universes of combinatorial games, as defined in a recent paper by the same authors, include many standard short normal- mis\`ere- and scoring-play monoids. In this note we show that the class is categorical, by extending Joyal's…

The impartial combinatorial game Kayles is played on a row of pins, with players taking turns removing either a single pin or two adjacent pins. A natural partizan variation is to allow one player to remove only a single pin and the other…

A \emph{bipartite monoid} is a commutative monoid $\Q$ together with an identified subset $\P \subset \Q$. In this paper we study a class of bipartite monoids, known as \emph{mis\`ere quotients}, that are naturally associated to impartial…

Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not…

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…

We consider Subtraction Nim, where two players have exactly the same options, but which is partizan in the sense that at the game ending, a partizan rule is applied for the decision of the winner. We consider the following example: Let $S$…

In an atomic, cancellative, commutative monoid $S$, the elasticity of an element provides a coarse measure of its non-unique factorizations by comparing the largest and smallest values in its set of factorization lengths (called its length…

An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…

We study the abstract Banach-Mazur game played with finitely generated structures instead of open sets. We characterize the existence of winning strategies aiming at a single countably generated structure. We also introduce the concept of…

The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…