N is a 2 x n matrix:(adsbygoogle = window.adsbygoogle || []).push({});

N =

1 2 3 4 ... n-1 n

n n-1 .... 4 3 2 1

then N^2 =

1 2 3 4 ... n-1 n

1 2 3 4 ... n-1 n

You COULD use the theorem: sgn(N^2) = sgn(N)sgn(N)

however, im asked to find sgn(N^2) by the traditional method: sgn(N^2) = (-1)^([L1 - 1] + [L2 - 1].....) where L represents the respective lengths of each cycle. However, N^2 has no cycles, so im confused.

How would I go about this? thanks.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# No cycles in permutation N how to calculate sgn(N^2)?

Loading...

Similar Threads - cycles permutation calculate | Date |
---|---|

Modern Algebra: Permutations and Cycles | Feb 16, 2012 |

Composition of permutation cycles | Jul 30, 2011 |

Counting cycles in a permutation | Sep 27, 2008 |

Multiplying non-disjoint permutation cycles | Apr 10, 2007 |

Composing permutations in cycle notation | Feb 27, 2007 |

**Physics Forums - The Fusion of Science and Community**