Abstract Algebra: Theory and Applications · Problem 6.5.15

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · cycle-structure-conjugacy

Problem

The cycle structure of a permutation σ\sigma is defined as the unordered list of the sizes of the cycles in the cycle decomposition σ\sigma. For example, the permutation σ=(1 2)(3 4 5)(7 8)(9)\sigma = (1\,2)(3\,4\,5)(7\,8)(9) has cycle structure (2,3,2,1)(2,3,2,1) which can also be written as (1,2,2,3)(1,2,2,3). Show that any two permutations α,β∈Sn\alpha, \beta \in S_n have the same cycle structure if and only if there exists a permutation γ\gamma such that β=γαγ−1\beta = \gamma\alpha\gamma^{-1}. If β=γαγ−1\beta = \gamma\alpha\gamma^{-1} for some γ∈Sn\gamma \in S_n, then α\alpha and β\beta are conjugate.

Browse the problem library