# Cycle type of a permutation

(Redirected from Cycle type)
Jump to: navigation, search

## Definition

Let $S$ be a finite set and $\sigma:S \to S$ be a permutation. The cycle type of $\sigma$ is the data of how many cycles of each length are present in the cycle decomposition of $\sigma$. There are two typical ways of specifying the cycle type.

The definition also applies for infinite sets; here, we also need to include cycles of infinite length, i.e., the chains.

### Definition as an unordered list of cycle sizes

The cycle type of a permutation is defined as the unordered list of the sizes of the cycles in the cycle decomposition of $\sigma$. For instance, consider the permutation with cycle decomposition: $(1,3,5)(2,4)(6)(7,8)$

This permutation has cycle type $(3,2,1,2)$. Since this is an unordered list, this can also be written as $(1,2,2,3)$ or $(1,2,3,2)$.

Note that the sum of all the cycle sizes must equal the size of the whole set $S$. Thus, the cycle type of a permutation is an unordered integer partition of the size of the set.

### Definition as information of how many cycles of each length there are

This decsribes the cycle type as an ordered sequence $i_1, i_2, i_3, \dots$ where $i_j$ is the number of cycles of size (length) $j$. Thus, the permutation: $(1,3,5)(2,4)(6)(7,8)$

has $i_1 = 1, i_2 = 2, i_3 = 1$ and $i_j = 0, j \ge 4$.

Note that give the cycle type in either form, it can be converted to the other form.
{"ft_lang_label":"__label__en","ft_lang_prob":0.89990056,"math_prob":0.99939597,"size":1509,"snap":"2021-21-2021-25","text_gpt3_token_len":314,"char_repetition_ratio":0.19534884,"word_repetition_ratio":0.06593407,"special_character_ratio":0.20410869,"punctuation_ratio":0.09698997,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998721,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,7,null,7,null,7,null,null,null,7,null,null,null,null,null,null,null,7,null,7,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-16T22:45:38Z\",\"WARC-Record-ID\":\"<urn:uuid:71b1799d-6bc7-4b59-ab2c-f1aaa64a8acd>\",\"Content-Length\":\"25585\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3359f6c2-98f5-4f1a-a908-2bc7d8b23a8a>\",\"WARC-Concurrent-To\":\"<urn:uuid:cfd20592-4c46-41b9-b232-0627ba36b62d>\",\"WARC-IP-Address\":\"96.126.114.7\",\"WARC-Target-URI\":\"https://groupprops.subwiki.org/wiki/Cycle_type\",\"WARC-Payload-Digest\":\"sha1:BEPBPU3BBJW7GO3P2A35KCYPSPO6AGV7\",\"WARC-Block-Digest\":\"sha1:ICIJXRUTA24PFKGTP5YGM7G545GLCEQH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487626122.27_warc_CC-MAIN-20210616220531-20210617010531-00092.warc.gz\"}"}