Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations

Details Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations

2007-04-23

arxiv.org/abs/0704.3067v1

Mathematics

Combinatorics

18 pages

Scientific paper

We provide a non-recursive description for the bounded admissible sets of masks used by Deodhar's algorithm to calculate the Kazhdan--Lusztig polynomials $P_{x,w}(q)$ of type $A$, in the case when $w$ is hexagon avoiding and maximally clustered. This yields a combinatorial description of the Kazhdan--Lusztig basis elements of the Hecke algebra associated to such permutations $w$. The maximally-clustered hexagon-avoiding elements are characterized by avoiding the seven classical permutation patterns $\{3421, 4312, 4321, 46718235, 46781235, 56718234, 56781234\}$. We also briefly discuss the application of heaps to permutation pattern characterization.

Affiliated with

Also associated with

No associations

Rating

Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224872