Advertisement

Journal of Algebraic Combinatorics

, Volume 42, Issue 4, pp 1059–1076 | Cite as

Type A molecules are Kazhdan–Lusztig

  • Michael Chmutov
Article
  • 105 Downloads

Abstract

Let (WS) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori–Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori–Hecke algebra on the Kazhdan–Lusztig basis, as well as this graph’s strongly connected components (cells). In 2008, Stembridge identified some common features of the Kazhdan–Lusztig graphs and gave a combinatorial characterization of all W-graphs that have these features. He conjectured, and checked up to \(n=9\), that all such \(A_n\)-cells are Kazhdan–Lusztig cells. The current paper provides a first step toward a potential proof of the conjecture. More concretely, we prove that the connected subgraphs of \(A_n\)-cells consisting of simple (i.e., directed both ways) edges are dual equivalence graphs in the sense of Assaf and thus are the same as the ones in the Kazhdan–Lusztig cells.

Keywords

Iwahori–Hecke algebra W-graphs W-molecules  Dual equivalence graphs Kazhdan–Lusztig cells 

Mathematics Subject Classification

05E10 20C08 

Notes

Acknowledgments

I would like to thank John Stembridge for suggesting the problem. I am also grateful to him as well as to Jonah Blasiak, Shifra Reif, and Elena Yudovina for many useful discussions, and to an anonymous referee for carefully reading the final document and providing valuable suggestions.

References

  1. 1.
    Assaf, S.H.: Dual equivalence graphs and a combinatorial proof of LLT and Macdonald positivity, 2013 (2010). arXiv:1005.3759v5
  2. 2.
    Chmutov, M.: Type \(A\) molecules are Kazhdan–Lusztig. In: DMTCS Proceedings, 25th International Conference on Formal Power Series and Algebraic Combinatorics, pp. 313–324 (2013)Google Scholar
  3. 3.
    Chmutov, M.: The structure of \(W\)-graphs arising in Kazhdan–Lusztig theory. Ph.D. thesis, University of Michigan (2014)Google Scholar
  4. 4.
    Haiman, M.D.: Dual equivalence with applications, including a conjecture of Proctor. Discrete Math. 99(1–3), 79–113 (1991)MathSciNetGoogle Scholar
  5. 5.
    Kazhdan, D., Lusztig, G.: Representations of Coxeter groups and Hecke algebras. Invent. Math. 53(2), 165–184 (1979)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Knuth, D.E.: Permutations, matrices, and generalized Young tableaux. Pac. J. Math. 34(3), 709–727 (1970)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Roberts, A.: Dual equivalence graphs revisited and the explicit Schur expansion of a family of LLT polynomials. J. Algebraic Comb. 39(2), 389–428 (2014)zbMATHCrossRefGoogle Scholar
  8. 8.
    Stembridge, J.R.: Admissible \(W\)-graphs. Represent. Theory 12, 346–368 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Stembridge, J.R.: More \(W\)-graphs and cells: molecular components and cell synthesis. Workshop notes, http://atlas.math.umd.edu/papers/summer08/stembridge08.pdf (2008)
  10. 10.
    Stembridge, J.R.: Personal communication (2011)Google Scholar
  11. 11.
    Stembridge, J.R.: A finiteness theorem for \(W\)-graphs. Adv. Math. 229, 2405–2414 (2012)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of MinnesotaMinneapolisUSA

Personalised recommendations