Related papers: Weyl Groups and the Modified Kostant Game
We examine a type of modified Monte Carlo Tree Search (MCTS) for strategising in combinatorial games. The modifications are derived by analysing simplified strategies and simplified versions of the underlying game and then using the results…
Recently, Wang and the second author constructed a bar involution and canonical basis for a quasi-permutation module of the Hecke algebra associated to a type B Weyl group $W$, where the basis is parameterized by left cosets of a…
Here we will use results of Cox, Durrett, and Perkins for voter model perturbations to study spatial evolutionary games on $Z^d$, $d\ge 3$ when the interaction kernel is finite range, symmetric, and has covariance matrix $\sigma^2I$. The…
We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the $\mu$-calculus. To this end we devise a method…
We define a reduction covariant for the representations a la Vinberg associated to stably graded Lie algebras. We then give an analogue of the LLL algorithm for the odd split special orthogonal group and show how this can be combined with…
A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…
This paper is a sequel to work of Dynkin on subroot lattices of root lattices and to work of Carter on presentations of Weyl group elements as products of reflections. The quotients $L/L_1$ are calculated for all irreducible root lattices…
Combinatorial Game Theory typically studies sequential rulesets with perfect information where two players alternate moves. There are rulesets with {\em entailing moves} that break the alternating play axiom and/or restrict the other…
We continue the study of extended Weyl groups $W$, which are reflection groups. Further we recall the definition of a hyperbolic cover of an extended Weyl group, and show that the hyperbolic covers of the extended Weyl groups are extended…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
We introduce a new version $kk^{\rm alg}$ of bivariant $K$-theory that is defined on the category of all locally convex algebras. A motivating example is the Weyl algebra $W$, i.e. the algebra generated by two elements satisfying the…
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus…
An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the future values of the other variables. This restriction is…
Compositional Game Theory is a new, recently introduced model of economic games based upon the computer science idea of compositionality. In it, complex and irregular games can be built up from smaller and simpler games, and the equilibria…
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…
Rex, short for Reverse Hex, is a set coloring game in which players try to avoid connecting terminals of their color. Combinatorial game theory (CGT) is the study of perfect strategy games. Until recently, both Rex and Hex were not examined…
We prove universal (case-free) formulas for the weighted enumeration of factorizations of Coxeter elements into products of reflections valid in any well-generated reflection group $W$, in terms of the spectrum of an associated operator,…
Kostka-Foulkes polynomials are Lusztig's $q$-analogues of weight multiplicities for irreducible representations of semisimple Lie algebras. It has long been known that these polynomials have non-negative coefficients. A statistic on…
A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…
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…