不尽相同元的环排列计数问题  

The Counting Problems of Round Permutation with Repetition

作　　者：申红莲[1] 

机构地区：[1]衡水学院数学与计算机科学学院,河北衡水053000

出　　处：《衡水学院学报》2013年第1期7-8,共2页Journal of Hengshui University

摘　　要：不尽相同元的环排列是一个比较复杂的问题.通过举例分析了圆排列中的各种情况,利用圆排列计数和对称圆排列计数,给出了不尽相同元的环排列公式,并且给予了证明,为更好地使用环排列公式打下坚实的基础.Round permutation with repetition is a very complicated problem. This paper analyzed a variety of situations in circular permutation, using the counting of circular permutation and symmetric circular permutation, gave and proved the formula of round permutation with repetition, which has laid a good foundation for its further application.

关 键 词：圆排列 环排列 计数 

分 类 号：O157[理学—数学]