Classification of minimal clones over a finite field in multiple-valued logic
Project/Area Number |
20540111
|
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 University, 大学院・アーツ・サイエンス研究科, 研究員 (40090534)
|
Co-Investigator(Kenkyū-buntansha) |
YAMASAKI Hideki 一橋大学, 大学院・商学研究科, 教授 (30108188)
|
Co-Investigator(Renkei-kenkyūsha) |
POGOSYAN Grant 国際基督教大学, 教養学部, 教授 (90234640)
|
Project Period (FY) |
2008 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2009: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2008: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
Keywords | 離散数学 / 普遍代数 / 多値論理 |
Research Abstract |
For a fixed set A, a set of multi-variable functions defined over A is called a clone if it contains all projections and is closed with respect to (functional) composition. The set of all clones on A has the structure of a lattice. An atom of the lattice of clones is called a minimal clone. In this research, we introduced the structure of a finite field into the base set A and considered generating functions of minimal clones as polynomials over the finite field A. Under this new point of view, we aimed at classifying minimal clones. For minimal clones which are generated by binary idempotent functions or ternary majority functions, we have succeeded to find the polynomial expressions of their minimal functions for arbitrary A with the cardinality of prime power.
|
Report
(4 results)
Research Products
(56 results)