| Project/Area Number |
11640131
|
|---|
| 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 | University of Shizuoka |
|---|
Principal Investigator |
KOBAYASHI Midori University of Shizuoka, School of Administration and Informal, Professor, 経営情報学部, 教授 (00136631)
|
|---|
| Project Period (FY) |
1999 – 2001
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥2,500,000 (Direct Cost: ¥2,500,000)
Fiscal Year 2001: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2000: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 1999: ¥900,000 (Direct Cost: ¥900,000)
|
|---|
| Keywords | neighbor design / Hamilton cycle / 1-factorization / dudeney set / Dudeney set / サイクルシステム |
|---|
| Research Abstract |
Dudeney's round table problem was proposed about one hundred year, ago. It is already solved when the number of people is even, but it is still unsettled except only few cases when the number of people is odd.
1. In this research, a solution of Dudeney's round table problem is given when n = p + 2, where p is an odd prime number such that -2 is a primitive root of GF(p), or 2 is the square of a primitive root of GF(p) and p≡3 (mod 4).
2. A double Dudeney set in K_n is a multiset of Hamilton cycles having the property that each 2-path lies in exactly two of the cycles. A double Dudeney set in K_n has been constructed when n is even. In this research, we constructed a double Dudeney set in K_n when n is odd.
3.Some classes of 1-factorizations of complete grahs are known. In this research, infinite kinds of new 1-factorizations of complete graphs are given.
4. Dudeney's round table problem is the problem of contructing a uniform covering of 2-paths by hamilton cyles. In this research, we constructed a uniform covering of 2-paths by 4-paths and a uniform covering of 2-paths by 5-paths.
|
