| Project/Area Number |
13640106
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Hitotsubashi University |
|---|
Principal Investigator |
MACHIDA Hajime Hitotsubashi Univ. Grad. S., Commerce and Management, Professor, 大学院・商学研究科, 教授 (40090534)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMADA Hiromichi Hitotsubashi Univ. Grad. S., Economics, Professor, 大学院・経済学研究科, 教授 (50134888)
YAMASAKI Hideki Hitotsubashi Univ. Grad. S., Commerce and Management, Professor, 大学院・商学研究科, 教授 (30108188)
IWASAKI Shiro Hitotsubashi Univ. Grad. S., Economics, Professor, 大学院・経済学研究科, 教授 (00001842)
山崎 昌男 一橋大学, 大学院・経済学研究科, 教授 (20174659)
|
|---|
| Project Period (FY) |
2001 – 2002
|
| Project Status |
Completed (Fiscal Year 2002)
|
| Budget Amount *help |
¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 2002: ¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 2001: ¥1,700,000 (Direct Cost: ¥1,700,000)
|
|---|
| Keywords | (mathematical) clone / Galois connection / lattice of clones |
|---|
| Research Abstract |
For a set A, a clone on A is a set of multi-variable functions which is closed under composition. Denote by L_A the set of all clones on A. In this reseach, for the set M_A of all monoids consisting of unary functions on A, we considered a naturally defined Galois connection between M_A and L_A. For a monoid M, the centralizer M^* of M is the set of all multi-variable functions which 'commutes' with every unary function in M.
1. <Some fundamental properties of the Galois connection> : (i) We showed that all centralizers of monoids are contained in some particular maximal clones. (ii) Also, we showed that for every pair of distinct monoids their centralizers are always distinct.
2. <Characterization of the centralizers of the symmetric group and the alternating group> : We established the characterization of the centralizers of both the symmetric group and the alternating group, the latter being more complex than the former.
3. <Classification of the centralizers for a sequence of monoids which contain the symmetric group> : A typical sequence {N_i} of monoids containing the symmetric group was defined. The centralizers of all N_i's have been determined. Most of them coincide with the least clone.
4. <Monoids whose centralizer is the least done> : It is 'natural' to think that under a Galois connection a small monoid corresponds to a big monoid. However, against this naive intuition, some small monoids have been discovered whose centralizer is the least clone.
5. <Application of the Kuznetsov criterion> : The power of the criterion established by Kuznetsov was shown to be quite useful in our study.
|
