2012
DOI: 10.1007/s00026-012-0172-3
|View full text |Cite
|
Sign up to set email alerts
|

Mask Formulas for Cograssmannian Kazhdan-Lusztig Polynomials

Abstract: ABSTRACT. We give two contructions of sets of masks on cograssmannian permutations that can be used in Deodhar's formula for Kazhdan-Lusztig basis elements of the Iwahori-Hecke algebra. The constructions are respectively based on a formula of Lascoux-Schützenberger and its geometric interpretation by Zelevinsky. The first construction relies on a basis of the Hecke algebra constructed from principal lower order ideals in Bruhat order and a translation of this basis into sets of masks. The second construction r… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 49 publications
(61 reference statements)
0
12
0
Order By: Relevance
“…We will show next that the resolution Ŝw is isomorphic to a particular Bott–Samelson resolution of Sw. We use Magyar's construction of Bott–Samelson resolutions as presented in Section 5 of . For every presentation w=w1wl(w)as a reduced word, i.e.…”
Section: The Resolution Of the Flag Schubert Varietiesmentioning
confidence: 99%
See 4 more Smart Citations
“…We will show next that the resolution Ŝw is isomorphic to a particular Bott–Samelson resolution of Sw. We use Magyar's construction of Bott–Samelson resolutions as presented in Section 5 of . For every presentation w=w1wl(w)as a reduced word, i.e.…”
Section: The Resolution Of the Flag Schubert Varietiesmentioning
confidence: 99%
“…Denote by BBS w the (bubblesort) Bott–Samelson resolution induced by this presentation of w . The projection map between BBS w and normalFl1,2,,nfalse(Efalse) that gives the resolution of Sw is defined by (compare ): [V1,,Vl(w)](Vp(1),,Vp(i),,E)where p(i) for in1 is the total number of transpositions needed to bring w(n) to the last spot, …, w(i+1) to spot i+1. In other words: pfalse(ifalse)=j=i+1n#false{1kn3.33333ptfalse|3.33333ptw(k)>w(j)false}and this is also the index of last occurence of si in the bubblesort reduced word for w .…”
Section: The Resolution Of the Flag Schubert Varietiesmentioning
confidence: 99%
See 3 more Smart Citations