This paper examine all sums of the form where W is a classical Weyl group, g is a one-dimensional character of W, and d(n) is the descent statistic. This completes a picture which is known when Wis the symmetric group S, (the Weyi group A,\_ 1). Surprisingly, the answers turn out to be simpler and
Combinatorial Models for Weyl Characters
โ Scribed by John R. Stembridge
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 248 KB
- Volume
- 168
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
โฆ Synopsis
We present a set of axioms for combinatorial objects closely related to those for Kashiwara's crystals. We show that any model for the axioms, such as Littelmann's path model, has a character-a nonnegative sum of irreducible characters for a semisimple Lie group or algebra, or more generally, a symmetrizable Kac-Moody algebra. Moreover, there are simple explicit restriction rules and rules for decomposing the product of any such character by an irreducible character.
๐ SIMILAR VOLUMES
We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and co
We generalize I. Frenkel's orbital theory for non twisted affine Lie algebras to the case of twisted affine Lie algebras using a character formula for certain nonconnected compact Lie groups.
The paper provides an explicit justification for the principle that a uniform taxon should contribute only one datapoint in comparative analyses with discrete variables. The justification is that phylogenetic patterns in variables unincluded in the proposed test vitiate the assumption of independenc
This paper presents a fuzzy logic approach to efficiently perform unsupervised character classification for improvement in robustness, correctness, and speed of a character recognition system. The characters are first split into seven typographical categories. The classification scheme uses pattern