Related papers: Misere Hackenbush Flowers

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…

Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without being equal in general. This paper provides a survey of…

The ordinary game of Nim has a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and lends itself to numerous other solutions to combinatorial…

We consider mis\`{e}re Nim as a normal-play game obtained from Nim by removing the terminal position. While explicit formulas are known for the Sprague-Grundy functions of Nim and Welter's game, no explicit formula is known for that of…

It was proved by Ginzburg and Mirkovic-Vilonen that the $G(O)$-equivariant perverse sheaves on the affine grassmannian of a connected reductive group $G$ form a tensor category equivalent to the tensor category of finite dimensional…

The Eisenbud-Green-Harris conjecture states that a homogeneous ideal in k[x_1,...,x_n] containing a homogeneous regular sequence f_1,...,f_n with deg(f_i)=a_i has the same Hilbert function as an ideal containing x_i^{a_i} for 1 \leq i \leq…

In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we…

Given $n$ piles of tokens and a positive integer $k \leq n$, we study the following two impartial combinatorial games Nim$^1_{n, \leq k}$ and Nim$^1_{n, =k}$. In the first (resp. second) game, a player, by one move, chooses at least $1$ and…

Let $n_{1}$ and $n_{2}$ be two integers with $n_{1},n_{2}\geq3$ and $G$ a graph of order $n=n_{1}+n_{2}$. As a generalization of Ore's degree condition for the existence of Hamilton cycle in $G$, El-Zahar proved that if $\delta(G)\geq…

In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their…

We study a generalisation of the bipartite Ramsey numbers to blowups of graphs. For a graph $G$, denote the $t$-blowup of $G$ by $G[t]$. We say that $G$ is $r$-Ramsey for $H$, and write $G \stackrel{r}{\rightarrow} H$, if every…

We study Hecke operators on moduli spaces of ramified $G$-bundles using the combinatorial language of Hecke graphs. We introduce a general notion of $\mathcal H$-ramification in the spirit of parahoric ramification, which depends on a…

Let $G$ be a finite group and $H$ a normal subgroup. $D(H;G)$ is the crossed product of $C(H)$ and ${\Bbb C}G$ which is only a subalgebra of $D(G)$, the quantum double of $G$. One can construct a $C^*$-subalgebra ${\mathcal{F}}_{_H}$ of the…

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…

Ryser proved that any two tournaments with the same score sequence are $C_3$-equivalent while Beineke and Moon proved the $C_4$-equivalence for any two bipartite tournaments with the same score lists. In this paper, we extend these results…

Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$-grading on $D$ a…

We introduce Multiplicative Modular Nim (MuM), a variant of Nim in which the traditional nim-sum is replaced by heap-size multiplication modulo m. We establish a complete theory for this game, beginning with a direct, Bouton-style analysis…

We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…

Grothendieck Duality -- the theory of the twisted inverse image pseudofunctor (-)^! over a suitable category of scheme-maps -- can be developed concretely, with emphasis on explicit constructions, or abstractly, with emphasis on…

When $H$ is a forest, the Gy\'arf\'as-Sumner conjecture implies that every graph $G$ with no induced subgraph isomorphic to $H$ and with bounded clique number has a stable set of linear size. We cannot prove that, but we prove that every…