Back

Title
  • Lascoux-Schuetzenbergerの算法によるHecke環の線形表現の構成
Creator
Subject
  • Other Hecke環
  • Other ヘッケ環
  • Other Kazhdan-Lusztig多項式
  • Other Lascoux
  • Other ヤング図形
Description
  • Other type:Thesis
  • Other 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.
Publisher 奈良女子大学大学院人間文化研究科
Date
    Created2008-07-07 , Issued2005-03-31
Language
  • jpn
Resource Type departmental bulletin paper
Version Type VoR
Identifier URI http://hdl.handle.net/10935/517
Journal
    • NCID AN10065983
    • ISSN 0913-2201
      • 人間文化研究科年報
      • Volume Number20 Page Start321 Page End333
File
Oaidate 2021-04-13