Related papers: Weyl Groups and the Modified Kostant Game
We present a new tool for the study of multiplayer stochastic games, namely the modified game, which is a normal-form game that depends on the discount factor, the initial state, and for every player a partition of the set of states and a…
We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…
Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$.…
The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…
We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational) logic-based involving advanced techniques from…
For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…
Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop a framework whereby the…
The purpose of this paper is to begin an exploration of connections between the Baum-Connes conjecture in operator $\K$-theory and the geometric representation theory of reductive Lie groups. Our initial goal is very modest, and we shall…
Capacitated network bargaining games are popular combinatorial games that involve the structure of matchings in graphs. We show that it is always possible to stabilize unit-weight instances of this problem (that is, ensure that they admit a…
The action of a Weyl group on the associated weight lattice induces an additive action on the symmetric algebra and a multiplicative action on the group algebra of the lattice. We show that the coinvariant space of the multiplicative action…
This paper has two parts. The main goal, carried out in Part I, is to survey some recent work by the authors in which "forced" grading constructions have played a significant role in the representation theory of semisimple algebraic groups…
We complete the classification of positive rank gradings on Lie algebras of simple algebraic groups over an algebraically closed field k whose characteristic is zero or not too small, and we determine the little Weyl groups in each case. We…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
The $q$-analog of Kostant's weight multiplicity formula is an alternating sum over a finite group, known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. This formula, when evaluated at $q=1$, gives the…
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…
A new descent algebra $\sum_{W}(A_{n})$ of Weyl groups of type $A_n$, constructed by present authors in [1], is generated by equivalence classes $[x_J]$ arising from the equivalence relation defined on the set of all $x_J$. In this paper,…
In this paper, we introduce the notion of combinatorial Auslander-Reiten(AR) quiver for commutation classes $[\widetilde{w}]$ of $w$ in finite Weyl group. This combinatorial object visualizes the convex partial order…
The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…
The root systems appearing in the theory of Lie superalgebras and Nichols algebras admit a large symmetry extending properly the one coming from the Weyl group. Based on this observation we set up a general framework in which the symmetry…
A new game-theoretic approach for combining multiple classifiers is proposed. A short introduction in Game Theory and coalitions illustrate the way any collective decision scheme can be viewed as a competitive game of coalitions that are…