| Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2017: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2016: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2015: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Outline of Final Research Achievements |
We apply rearrangement problem of two-dimensional arrays which is a generalization of pancake sorting problem in computer science to construction os a universal hah function. We also study recursive construction of graphs to apply to constructions of universal hash functions. We prove that 1-factorization of a regular complete tripartite graph is equivalent to a combinatorial design on a cube satisfying latin property. Using the equivalence, we prove that a regular complete tripartite graph is 1-factorizable. It is conjectured that a regular graph of order n and degree 2n is 1-factorizable, however, it is an open problem called the 1-factorization conjecture. Our result provide a partial answer to the 1-factorization conjecture.
|
