Related papers: Weyl Groups and the Modified Kostant Game

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

We develop a rigorous mathematical framework for quantum game theory applied to static 2x2 games, extending classical concepts to the quantum setting where players may employ arbitrary unitary operations (pure strategies) or probability…

In most applications of semi-simple Lie groups and algebras representation theory, calculating weight multiplicities is one of the most often used and effort consuming operations. The existing tools were created many years ago by Kostant…

Lie groups with two different root lengths allow two mixed sign homomorphisms on their corresponding Weyl groups, which in turn give rise to two families of hybrid Weyl group orbit functions and characters. In this paper we extend the ideas…

In this paper we study the finitely generated algebras underlying $W$ algebras. These so called 'finite $W$ algebras' are constructed as Poisson reductions of Kirillov Poisson structures on simple Lie algebras. The inequivalent reductions…

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…

By studying the action of the Weyl group of a simple Lie algebra on its root lattice, we construct torsion free subgroups of small and explicitly determined index in a large infinite class of Coxeter groups. One spin-off is the construction…

Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inherent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is…

Motivated by work of Kac and Lusztig, we define a root system and a Weyl groupoid for a large class of semisimple Yetter-Drinfeld modules over an arbitrary Hopf algebra. The obtained combinatorial structure fits perfectly into an existing…

This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a…

We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…

Equivariant map algebras are Lie algebras of algebraic maps from a scheme (or algebraic variety) to a target finite-dimensional Lie algebra (in the case of the current paper, we assume the latter is a simple Lie algebra) that are…

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…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

We consider a connected compact Lie group K acting on a symplectic manifold M such that a moment map m exists. A pull-back function via m Poisson commutes with all K-invariants. Guillemin-Sternberg raised the problem to find a converse. In…

Let $(W,S)$ be a Coxeter system and $\ast$ be an automorphism of $W$ with order $\leq 2$ such that $s^{\ast}\in S$ for any $s\in S$. Let $I_{\ast}$ be the set of twisted involutions relative to $\ast$ in $W$. In this paper we consider the…

We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…

Let g be a Lie algebra of type A,D,E with fixed Cartan subalgebra h, root system R and Weyl group W. We show that a choice of Coxeter element C gives a root basis for g. Moreover we show that this root basis gives a purely combinatorial…

We investigate in detail relationships between the set ${\mathfrak B}^\infty$ of all infinite ``biconvex'' sets in the positive root system $\Delta_+$ of an arbitrary untwisted affine Lie algebra ${\mathfrak g}$ and the set ${\mathcal…

In this thesis we introduce quantum refereed games, which are quantum interactive proof systems with two competing provers. We focus on a restriction of this model that we call "short quantum games" and we prove an upper bound and a lower…