For a cycle type , the Murnaghan–Nakayama rule isThe sum is over partitions whose diagrams remain after removing the specified border strip; is the remaining cycle type, and the recursion ends with the empty character equal to one. At the identity, . Incompatible total sizes contribute zero.
Articles by others on the same topic
There are currently no matching articles.