Lascoux-Schutzenbergerの算法によるHecke環の線形表現の構成  [in Japanese] Irreducible Representations of Hecke Algebras of Type An and Lascoux-Schutzenberger Algorithm  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

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.

Journal

  • Annual report of Graduate School of Humanities and Sciences

    Annual report of Graduate School of Humanities and Sciences (20), 321-333, 2004

    Nara Women's University

Keywords

Codes

  • NII Article ID (NAID)
    110008667543
  • NII NACSIS-CAT ID (NCID)
    AN10065983
  • Text Lang
    JPN
  • Article Type
    departmental bulletin paper
  • Journal Type
    大学紀要
  • ISSN
    09132201
  • NDL Article ID
    7792549
  • NDL Source Classification
    ZV1(一般学術誌--一般学術誌・大学紀要)
  • NDL Call No.
    Z22-1407
  • Data Source
    NDL  NII-ELS  IR 
Page Top