Eriksson's numbers game and finite Coxeter groups
From MaRDI portal
Publication:942147
DOI10.1016/j.ejc.2007.06.029zbMath1146.91012arXiv0710.0173OpenAlexW2023206220MaRDI QIDQ942147
Publication date: 4 September 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.0173
Related Items (3)
The number of steps and the final configuration of relaxation procedures on graphs ⋮ Root Systems for Asymmetric Geometric Representations of Coxeter Groups ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions of representations of rank two semisimple Lie algebras with distributive lattices
- Convergence of Mozes's game of numbers
- Minuscule elements of Weyl groups, the numbers game, and \(d\)-complete posets
- Reachability is decidable in the numbers game
- The enumeration of fully commutative elements of Coxeter groups
- A combinatorial construction for simply-laced Lie algebras
- Minuscule posets from neighbourly graph sequences
- Reflection processes on graphs and Weyl groups
- On the fully commutative elements of Coxeter groups
- Kac-Moody groups, their flag varieties and representation theory
- The numbers game and Coxeter groups
- A Hecke algebra quotient and some combinatorial applications
- Strong convergence and a game of numbers
- Bruhat lattices, plane partition generating functions, and minuscule representations
- Combinatorics of Coxeter Groups
- Reflection Sequences
- On the root system of a coxeter group
- Distributive Lattices Defined for Representations of Rank Two Semisimple Lie Algebras
- Structure of a Hecke algebra quotient
This page was built for publication: Eriksson's numbers game and finite Coxeter groups