[Updated on Apr. 18] Integration of CiNii Articles into CiNii Research

Irreducible Representations of Hecke Algebras of Type An and Lascoux-Schutzenberger Algorithm


Bibliographic Information

Other Title
  • Lascoux-Schutzenbergerの算法によるHecke環の線形表現の構成
  • Lascoux Schutzenberger ノ サンポウ ニ ヨル Heckeカン ノ センケイ ヒョウゲン ノ コウセイ

Search this article


In this paper, we will construct the W-graphs corresponding to the irreducible representation of Hecke algebra H(q,n). The algorithm used is based on Lascoux-Schuetzenberger's method. We have constructed all the irreducible representations of H(q,n) for n up to 17. The sesult show that the 0-1 conjecture for the value of μ(x,y), i.e. μ(x,y) should be 0 or 1, is not true. This means that the leading coefficients of the Kazhdan-Lusztig Polynomial may have values greater than 1.


Citations (0)*help

See more


See more

Related Articles

See more

Related Data

See more

Related Books

See more

Related Dissertations

See more

Related Projects

See more

Related Products

See more



Report a problem

Back to top