| Project/Area Number |
13440014
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Algebra
|
|---|
| Research Institution | Nagoya University (2003)
Tokyo University of Science (2001-2002) |
|---|
Principal Investigator |
SHOJI Toshiaki Nagoya University, Graduate School of Mathematics, Professor, 大学院・多元数理科学研究科, 教授 (40120191)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
ARAKI Susumu Kyoto University, RIMS, Associate Professor, 大学院・数理解析研究所, 助教授 (40212641)
SHINODA Ken-ichi Sophia University, Faculty of Science and Technology, Professor, 理工学部, 教授 (20053712)
KAWANAKA Noriaki Osaka University, Graduate School of Information, Professor, 大学院・情報科学研究科, 教授 (10028219)
UZAWA Tohru Nagoya University, Graduate School of Math., Professor, 大学院・多元数理科学研究科, 教授 (40232813)
GYOJA Akihiko Nagoya University, Graduate School of Math., Professor, 大学院・多元数理科学研究科, 教授 (50116026)
吾郷 孝視 東京理科大学, 理工学部, 教授 (60112893)
浜畑 芳紀 東京理科大学, 理工学部, 講師 (90260645)
|
|---|
| Project Period (FY) |
2001 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥8,300,000 (Direct Cost: ¥8,300,000)
Fiscal Year 2003: ¥2,200,000 (Direct Cost: ¥2,200,000)
Fiscal Year 2002: ¥2,200,000 (Direct Cost: ¥2,200,000)
Fiscal Year 2001: ¥3,900,000 (Direct Cost: ¥3,900,000)
|
|---|
| Keywords | Luszfig's conjecture / special linear group / irreducible character / almost character / character sheaf / Shintani descent / symmetric space / 代数群 / Green関数 / Hall-Littlewood関数 / Macdonald関数 / 複素鏡映群 / 一般Green関数 / graded Hecke algebra / ヘッケ環 / 表現論 / Ariki-Koike algebra / 有限Chevalley群 |
|---|
| Research Abstract |
(1) I have proved the Luszfig's conjecture concerning the characters of finite special linear group SLn(〓_q) over finite field 〓_q. This conjecture provides as a general algorithm of computing irreducible characters of reductive group G(〓_q) over finite field, which is stated as 「almost characters and characteristic functions of character sheaves coincides with up to scalar multiple」. This conjecture we proved by the head investigator in the case where the center of G is connected. SLn is an example of disconnected enter. We can determine the scalars also, and we obtain a complete algorithm of computing irreducible characters.
(2) By the joint work with K.Sorlin, I have determined the deconpositon of the presentation G(〓_q^2) -with G(〓_q^2)/G(〓_q) for G=SLn.
|
