摘要
以排列矩阵及其等和变换为工具,给出两种计算k(Tn) 的数学方法,从而解决了如何以最少次数的对换将一个n类排列化为标准排列的问题.
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.
出处
《数学的实践与认识》
CSCD
北大核心
2005年第4期219-225,共7页
Mathematics in Practice and Theory
关键词
n类排列
最少对换次数
排列矩阵
等和变换
n class arrangement
the fewest times of transposion
arrangement matrix
equal sum transformation
