1997
DOI: 10.1006/aima.1996.1629
|View full text |Cite
|
Sign up to set email alerts
|

A Recursive Rule for Kazhdan–Lusztig Characters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
32
0

Year Published

1998
1998
2015
2015

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 26 publications
(33 citation statements)
references
References 28 publications
1
32
0
Order By: Relevance
“…In this paper we show that a generalized Littlewood Richardson rule implies a recursion theorem for the Kazhdan Lusztig characters of arbitrary Coxeter groups. This result explains and generalizes the recursion, which was found by direct calculations in [Ro,Theorem 1].…”
Section: Introductionsupporting
confidence: 68%
See 2 more Smart Citations
“…In this paper we show that a generalized Littlewood Richardson rule implies a recursion theorem for the Kazhdan Lusztig characters of arbitrary Coxeter groups. This result explains and generalizes the recursion, which was found by direct calculations in [Ro,Theorem 1].…”
Section: Introductionsupporting
confidence: 68%
“…This theorem generalizes the recursive part of [Ro,Theorem 1]. The following corollary is immediate.…”
Section: In [Bv]mentioning
confidence: 78%
See 1 more Smart Citation
“…We denote by U α the set of α-unimodal subsets of [n − 1]. The following statement is a special case of [2,Theorem 4].…”
Section: Symmetric and Quasisymmetric Functionsmentioning
confidence: 99%
“…Our main result (Theorem 3.1) is formulated and proven in Section 3, after background material has been reviewed in Section 2. The result is derived from the expansion of X G in the basis of fundamental quasisymmetric functions [4, Theorem 3.1] via a formula of Roichman [2] for the irreducible characters of the symmetric group (the proof is motivated by the discussion of character formulas and distributions of descent sets in [1,Section 6]). Section 4 exploits a known bijection [9] between certain permutations of a partially ordered set P and acyclic orientations of the incomparability graph of P to provide an alternative formulation (Corollary 4.2) of the main result.…”
Section: Introductionmentioning
confidence: 99%