Math 2.0

Group theory and generalizations Definition

Cycle type

Builds on Decomposition of a permutation into disjoint cycles

Definition

Let σ∈Sn\sigma \in S_n. Write σ\sigma as a product of disjoint cycles, and include a 11-cycle for each fixed point. The cycle type of σ\sigma is the multiset of the lengths of these cycles.

Remarks

The disjoint cycle decomposition is unique up to order, so the cycle type is well defined. The lengths add up to nn, so the cycle type is a partition of nn. For example, (1 2)(3 4 5)∈S6(1\ 2)(3\ 4\ 5) \in S_6 has cycle type (3,2,1)(3, 2, 1).

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cycle notation concept
  2. Group concept
  3. Symmetric group definition
  4. Disjoint cycles commute statement
  5. Decomposition of a permutation into disjoint cycles statement
  6. Cycle type definition

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Permutation, Cycle type
About this page
Tag0BCHJ30REG
URIm2://0BCHJ30REG
Aliasescycle-structure
Kinddefinition
WritingW0 stub
MSC20B30
DefinesCycle type
UsesDecomposition of a permutation into disjoint cycles

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by