W-graph determining elements in type A

Abstract: Let

(W, S)

be a Coxeter system of type

A

, so that

W

can be identified with the symmetric group

m a t h r m S y m (n)

for some positive integer

n

and

S

with the set of simple transpositions

, (i, i + 1) m i d 1 l e q s l a n t i l e q s l a n t n - 1,

. Let

l e q s l a n t_{m a t h s f L}

denote the left weak order on

W

, and for each

J s u b s e t e q S

let

w_{J}

be the longest element of the subgroup

W_{J}

generated by

J

. We show that the basic skew diagrams with

n

boxes are in bijective correspondence with the pairs

(w, J)

such that the set

, x i n W m i d w_{J} l e q s l a n t_{m a t h s f L} x l e q s l a n t_{m a t h s f L} w w_{J},

is a nonempty union of Kazhdan-Lusztig left cells. These are also the pairs

(w, J)

such that

m a t h s c r I (w) =, v i n W m i d v l e q s l a n t_{m a t h s f L} w,

is a

W!

-graph ideal with respect to

J

. Moreover, for each such pair the elements of

m a t h s c r I (w)

are in bijective correspondence with the standard tableaux associated with the corresponding skew diagram.

This page was built for publication: W-graph determining elements in type A