Question: Suppose a permutation is written (in cycle notation) as a collection of t disjoint cycles whose lengths are n1, n2, . . . , nt
Suppose a permutation is written (in cycle notation) as a collection of t disjoint cycles whose lengths are n1, n2, . . . , nt . (For example, (1, 4, 2) is a cycle of length 3.) Find a formula for sgn using only the numbers n1, n2, . . . , nt , and explain why it works.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
