Irreducible linear permutations and their counting
Zhihui Li · 2006
The concept of irreducible linear permutations is proposed.The properties of irreducible linear permutations are studied by using linear algebra theory,An characterization for maximal linear orthomorphism is shown using properties above obtained.Furthermore,the result that the length of rotation of any nonzero element in F~n_2 for an irreducible linear permutation σ is equal to the peromid of characteristic polynomial of σ is obtained.Finally,the counting formula for irreducible linear permutations is given.