| 拉丁方与置换群 |
| |
| 引用本文： | 张涌逸.拉丁方与置换群[J].山西农业大学学报(自然科学版),2005,25(4):407-409. |
| |
| 作者姓名： | 张涌逸 |
| |
| 作者单位： | 太原师范学院,计算机系,山西,太原,030012 |
| |
| 摘 要： | 为了解决正交拉丁方完备组问题,利用代数方法讨论了拉丁方与正则群的关系。我们得到的结论是一个正则群可确定一个拉丁方,反之,一个拉丁满足一定条件也可确定一个正则群。同时我们还讨论了n阶正交拉丁方组与置换之间的联系。
|
| 关 键 词： | 拉丁方 n阶正交拉丁方 置换群 正则群 |
| 文章编号： | 1671-8151（2005）04-0407-03 |
| 收稿时间： | 2004-12-10 |
| 修稿时间： | 2005-03-18 |
Latin Squares and Permutation Groups |
| |
| ZHANG Yong-yi.Latin Squares and Permutation Groups[J].Journal of Shanxi Agricultural University,2005,25(4):407-409. |
| |
| Authors: | ZHANG Yong-yi |
| |
| Institution: | Department of Computer, Taiyuan Teachers College, Taiyuan Shanxi 030012, China |
| |
| Abstract: | In order to solve the problem of complete system of orthogonal Latin squares, relation between Latin square and permutation groups is discussed by using method of algebra. The conclusion is that a permutation group can determine a Latin square; vice conversely, a Latin square which satisfies a condition can determine a permutation group. At the same time, relation between orthogonal Latin squares and permutation will be studied. |
| |
| Keywords: | Latin square Orthogonal Latin squares Permutation groups |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
