| 关于n类排列的最少对换次数 |
| |
| 引用本文： | 李淑敏,王炳安. 关于n类排列的最少对换次数[J]. 数学的实践与认识, 2005, 35(4): 219-225 |
| |
| 作者姓名： | 李淑敏 王炳安 |
| |
| 作者单位： | 大连大学信息工程学院,大连,116622 |
| |
| 摘 要： | 以排列矩阵及其等和变换为工具,给出两种计算k(Tn) 的数学方法,从而解决了如何以最少次数的对换将一个n类排列化为标准排列的问题.
|
| 关 键 词： | n类排列 最少对换次数 排列矩阵 等和变换 |
| 修稿时间： | 2004-12-13 |
The Fewest Times of Transposion about n Class Arrangement |
| |
| LI Shu-min,WANG Bing-an. The Fewest Times of Transposion about n Class Arrangement[J]. Mathematics in Practice and Theory, 2005, 35(4): 219-225 |
| |
| Authors: | LI Shu-min WANG Bing-an |
| |
| Abstract: | This paper gives two methods caculating k(T_n) by the arrangement matrix and the equal sum transformation. Then the question, how to change an n class arrangement into a standard arrangement by the transposion with the fewest times, is solved. |
| |
| Keywords: | n class arrangement the fewest times of transposion arrangement matrix equal sum transformation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
