| Project/Area Number |
16540020
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Algebra
|
|---|
| Research Institution | Shinshu University |
|---|
Principal Investigator |
HANAKI Akihide Shinshu University, Faculty of Science, Associate Professor (50262647)
|
|---|
| Project Period (FY) |
2004 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,010,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥210,000)
Fiscal Year 2007: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2006: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2005: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2004: ¥600,000 (Direct Cost: ¥600,000)
|
|---|
| Keywords | association scheme / adiacency algebra / representation / character / 強正則閉部分集合 / クリフォードの定理 / association scheme / character / cyclotomic scheme / representation / modular representation |
|---|
| Research Abstract |
The results of this project is as follows:
1. We showed that every association scheme of prime order is commutative. Moreover, if the minimal splitting field of the scheme is an abelian number field, then the scheme is algebraically isomorphic to a well-known one.
2. We generalized Clifford theory of finite groups to association schemes. Especially, we found a method to construct new irreducible representations from a given one.
3. We showed that, if a scheme of prime square order has a non-trivial thin closed subset, then the scheme is commutative.
4. We showed that, if a scheme of prime square order has a proper strongly normal closed subset, then the scheme is commutative.
5. We defined nilpotent schemes and investigated their basic properties.
6. We considered modular standard modules of association schemes. Consequently, we could distinguish some algebraically isomorphic schemes by their invariants.
7. We considered products of characters of association schemes and gave a sufficient condition of the product to be again a character.
8. We gave an inequality for the order of a primitive association schemes. In a sense, our bound is better than the well-known "absolute hound condition.
|
