• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A research on hook length posets from combinatorics and representation theory

Research Project

Project/Area Number 15540028
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Algebra
Research InstitutionWAKAYAMA UNIVERSITY

Principal Investigator

TAGAWA Hiroyuki  Wakayama University, Faculty of Education, Associate Professor, 教育学部, 准教授 (80283943)

Project Period (FY) 2003 – 2006
Project Status Completed (Fiscal Year 2006)
Budget Amount *help
¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2006: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2005: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2004: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2003: ¥1,300,000 (Direct Cost: ¥1,300,000)
Keywordshook length poset / hook length formula / d-complete poset / Coxeter group
Research Abstract

The purpose of this research is a strict classification of hook length posets, a clarification of combinatorial and representative structure of hook length posets. Chiefly, the following results were obtained.
1. We introduced a poset (called a leaf poset) which is an extension of the d-complete poset, and we showed that all leaf posets are hook length posets. As a corollary of the above result, we found many identities with respect to Schur functions, which are analogues or extensions of Cauchy's identity. Also, we proved that all leaf posets are multivaliable hook length posets. Here, we call a hook length poset a multivaliable hook length poset if its hook length formula can be extended to a multivaliable formula. Moreover, we found a composition method of a hook length poset by using a known (multivaliable) hook length poset. Any hook length poset with at most seven elements is constructed by this composition method.
2. We proved several identities of Cauchy-type determinant and Schur-type Pfaffian, which was conjectured by Soichi Okada in 2003.
3. It is known that a (lambda-) minuscule element of a Coxeter group is a fully commutative element, and a fully commutative element of a symmetric group is equal to a 321-avoiding permutation. For a Coxeter group, we introduced a fully covering element which was an extension of 321-avoiding permutations, and we proved that the Coxeter groups whose fully commutative elements coincide with their fully covering elements are the Coxeter groups of type A, D, E.

Report

(5 results)
  • 2006 Annual Research Report   Final Research Report Summary
  • 2005 Annual Research Report
  • 2004 Annual Research Report
  • 2003 Annual Research Report
  • Research Products

    (4 results)

All 2006 2004

All Journal Article (4 results)

  • [Journal Article] Generalizations of Cauchy's determinant and Schur's Pfaffian2006

    • Author(s)
      M.Ishikawa, S.Okada, H.Tagawa, J.Zeng
    • Journal Title

      Advances in Applied Mathematics 36

      Pages: 251-287

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Generalizations of Cauchy's determinant and Schur's Pfaffian2006

    • Author(s)
      M.Ishikawa, S.Okada, H.Tagawa, J.Zeng
    • Journal Title

      Advances in Applied Mathematics 36・3

      Pages: 251-287

    • Related Report
      2005 Annual Research Report
  • [Journal Article] A characterization of the simply-laced FC-finite Coxeter groups2004

    • Author(s)
      M.Hagiwara, M.Ishikawa, H.Tagawa
    • Journal Title

      Annals of Combinatorics 8

      Pages: 177-196

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] A Characterization of the Simply-Laced FC-finite Coxeter Groups2004

    • Author(s)
      M.Hagiwara, M.Ishikawa, H.Tagawa
    • Journal Title

      Annals of Combinatorics 8

      Pages: 177-196

    • Related Report
      2004 Annual Research Report

URL: 

Published: 2003-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi