Related papers: Weyl Groups and the Modified Kostant Game
This paper establishes a novel combinatorial framework at the intersection of Lie theory and algebraic combinatorics, based on a generalization of the Kostant game. We begin by reviewing the foundations of root systems, the classification…
We develop a relative version of Kostant's harmonic theory and use this to prove a relative version of Kostant's theorem on Lie algebra (co)homology. These are associated to two nested parabolic subalgebras in a semisimple Lie algebra. We…
The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite…
In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra…
Parabolic subgroups $W_I$ of Coxeter systems $(W,S)$, as well as their ordinary and double quotients $W / W_I$ and $W_I \backslash W / W_J$, appear in many contexts in combinatorics and Lie theory, including the geometry and topology of…
For integral weights $\lambda$ and $\mu$ of a classical simple Lie algebra $\mathfrak{g}$, Kostant's weight multiplicity formula gives the multiplicity of the weight $\mu$ in the irreducible representation with highest weight $\lambda$,…
In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…
Let $G$ be a simple complex Lie group with Weyl group $W$. We give a formula for the character of $W$ on the zero weight space of any finite dimensional representation of $G$. The formula involves partition functions, generalizing Kostant's…
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…
We prove an analogue of Kostant's convexity theorem for split real and complex Kac-Moody groups associated to free and cofree root data. The result can be seen as a first step towards describing the multiplication map in a Kac-Moody group…
The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…
For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…
This paper studies connections between the preprojective representations of a valued quiver, the (+)-admissible sequences of vertices, and the Weyl group by associating to each preprojective representation a canonical (+)-admissible…
The Distributional Alignment Game framework provides a powerful variational perspective on Answer-Level Fine-Tuning (ALFT). However, standard algorithms for these games rely on estimating logarithmic rewards from small batches, introducing…
The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…
Motivated by Lusztig's $G$-stable pieces, we consider the combinatorial pieces: the pairs $(w, K)$ for elements $w$ in the Weyl group and subsets $K$ of simple reflections that are normalized by $w$. We generalize the notion of cyclic shift…
We study the eigenspace decomposition of a basic classical Lie superalgebra under the adjoint action of a toral subalgebra, thus extending results of Kostant. In recognition of Kostant's contribution we refer to the eigenspaces appearing in…
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…