摘要
为了解决正交拉丁方完备组问题,利用代数方法讨论了拉丁方与正则群的关系。我们得到的结论是一个正则群可确定一个拉丁方,反之,一个拉丁满足一定条件也可确定一个正则群。同时我们还讨论了n阶正交拉丁方组与置换之间的联系。
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.
出处
《山西农业大学学报（自然科学版）》
CAS
2005年第4期407-409,共3页
Journal of Shanxi Agricultural University(Natural Science Edition)
关键词
拉丁方
n阶正交拉丁方
置换群
正则群
Latin square
Orthogonal Latin squares
Permutation groups
