| 一类可排序群的排序个数问题 |
| |
| 引用本文： | 李诠娜,海进科.一类可排序群的排序个数问题[J].青岛大学学报(自然科学版),2007,20(3):12-16. |
| |
| 作者姓名： | 李诠娜 海进科 |
| |
| 作者单位： | 青岛大学,数学科学学院,青岛,266071 |
| |
| 摘 要： | 把群的基本性质同组合数学相关知识相结合,主要研究了可排序群的排序个数问题,得到了交换群元素排序个数的计算公式等几个有意义的结果,而且这些结果反过来也可以确定群,特别是交换群的结构。
|
| 关 键 词： | 可排序群 排序个数 Latin方 Hamiltonian路 |
| 文章编号： | 1006-1037（2007）03-0012-05 |
| 收稿时间： | 2007-04-19 |
| 修稿时间： | 2007年4月19日 |
The Problem of the Number of Sequencings for a Class of Sequenceable Groups |
| |
| LI Quan-na,HAI Jin-ke.The Problem of the Number of Sequencings for a Class of Sequenceable Groups[J].Journal of Qingdao University(Natural Science Edition),2007,20(3):12-16. |
| |
| Authors: | LI Quan-na HAI Jin-ke |
| |
| Institution: | College of Mathematics, Qingdao University, Qingdao 266071, China |
| |
| Abstract: | This paper mainly devotes to a problem of the number of sequencings for Abelian sequenceable groups by connecting basic properties of groups with combinatorial methemabics. Some significant results are obtained, such as the computation formula of the number of sequencings in Abelian groups. Conversely, the structure of Abelian groups can be determined using our results. |
| |
| Keywords: | sequenceable groups the number of sequencings Latin squares Hamiltonian paths |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
