I'm trying to show that for two permutations f ang g in Sn, the number of disjoint cycles in fg is the same as the number of disjoint cycles in gf. I know that in general fg does not equal gf, but by working examples it seems like they always decompose into the same number of disjoint cycles. Is this even true? Can anyone find a counterexample?(adsbygoogle = window.adsbygoogle || []).push({});

I solved the related problem of showing that fg and gf both fix the same number of elements. This is true because fg fixes x if and only if gf fixes g(x), and g is a bijection.

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

Join Physics Forums Today!

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

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

# Counting cycles in a permutation

Loading...

Similar Threads - Counting cycles permutation | Date |
---|---|

Counting the distinct values of a modular mapping | Jun 22, 2014 |

Counting the number of codes | Aug 1, 2012 |

By Listing Them Randomly, Could we Count the Irrationals? | Jul 11, 2012 |

Counting theorem | May 14, 2012 |

Counting cycles in S_5 | Jul 25, 2011 |

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