Principal Möbius function values for permutations under classic pattern containment

These files have the value of the principal Möbius function \mu[1, \pi] for all canonical permutations with length 12 or less.<br>A permutation is canonical if, amongst the symmetries of the permutation, it has smallest lexicographic order.<br>Each line contains the permutation, the number of symmetries, and the value of the principal Möbius function, separated by semi-colons. For example,<br>{1,3,2} ; 4 ; -1<br>tells us that the permutation 132 has four symmetries, and that the value of the principal Möbius function is -1.<br><br><br><br>本数据集文件包含所有长度不超过12的规范置换（canonical permutation）对应的主默比乌斯函数（principal Möbius function）μ[1, π]的取值。 若一个置换在其所有对称变换中具有最小字典序，则该置换为规范置换。 每行内容以分号分隔，依次包含置换、对称变换的数量以及主默比乌斯函数的取值。例如： {1,3,2} ; 4 ; -1 该示例表明，置换132存在4个对称变换，其对应的主默比乌斯函数取值为-1。