Your data matches 6 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001711
St001711: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 1
[1,1]
=> 1
[3]
=> 1
[2,1]
=> 3
[1,1,1]
=> 1
[4]
=> 1
[3,1]
=> 1
[2,2]
=> 1
[2,1,1]
=> 5
[1,1,1,1]
=> 1
[5]
=> 1
[4,1]
=> 5
[3,2]
=> 1
[3,1,1]
=> 1
[2,2,1]
=> 5
[2,1,1,1]
=> 7
[1,1,1,1,1]
=> 1
[6]
=> 3
[5,1]
=> 1
[4,2]
=> 1
[4,1,1]
=> 9
[3,3]
=> 1
[3,2,1]
=> 3
[3,1,1,1]
=> 1
[2,2,2]
=> 9
[2,2,1,1]
=> 17
[2,1,1,1,1]
=> 9
[1,1,1,1,1,1]
=> 1
[7]
=> 1
[6,1]
=> 3
[5,2]
=> 1
[5,1,1]
=> 1
[4,3]
=> 1
[4,2,1]
=> 7
[4,1,1,1]
=> 13
[3,3,1]
=> 19
[3,2,2]
=> 1
[3,2,1,1]
=> 5
[3,1,1,1,1]
=> 1
[2,2,2,1]
=> 15
[2,2,1,1,1]
=> 37
[2,1,1,1,1,1]
=> 11
[1,1,1,1,1,1,1]
=> 1
[8]
=> 1
[7,1]
=> 1
[6,2]
=> 3
[6,1,1]
=> 3
[5,3]
=> 1
[5,2,1]
=> 3
Description
The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. Let $\alpha$ be any permutation of cycle type $\lambda$. This statistic is the number of permutations $\pi$ such that $$ \alpha\pi\alpha^{-1} = \pi^2.$$
Matching statistic: St001524
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00093: Dyck paths to binary wordBinary words
St001524: Binary words ⟶ ℤResult quality: 12% values known / values provided: 12%distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0]
=> [1,1,0,0]
=> 1100 => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 110100 => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 111000 => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 11011000 => 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => ? = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1101011000 => ? = 1 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1101101000 => ? = 5 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => ? = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 110101010100 => ? = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 110101011000 => ? = 5 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => ? = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 110101101000 => ? = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1111001000 => ? = 5 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 110110101000 => ? = 7 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 111010101000 => ? = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 11010101010100 => ? = 3 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 11010101011000 => ? = 1 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 110101110000 => ? = 1 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> 11010101101000 => ? = 9 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1111010000 => ? = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 110111001000 => ? = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> 11010110101000 => ? = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1111100000 => ? = 9 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 111100101000 => ? = 17 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> 11011010101000 => ? = 9 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> 11101010101000 => ? = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 1101010101010100 => ? = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 1101010101011000 => ? = 3 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> 11010101110000 => ? = 1 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> 1101010101101000 => ? = 1 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 110111010000 => ? = 1 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> 11010111001000 => ? = 7 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> 1101010110101000 => ? = 13 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 111101001000 => ? = 19 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 110111100000 => ? = 1 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> 11011100101000 => ? = 5 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> 1101011010101000 => ? = 1 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 111110001000 => ? = 15 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> 11110010101000 => ? = 37 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> 1101101010101000 => ? = 11 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0]
=> 1110101010101000 => ? = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 110101010101010100 => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 110101010101011000 => ? = 1 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> 1101010101110000 => ? = 3 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> 110101010101101000 => ? = 3 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,1,0,0,0,0]
=> 11010111010000 => ? = 1 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> 1101010111001000 => ? = 3 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> 110101010110101000 => ? = 1 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 111101010000 => ? = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> 11011101001000 => ? = 5 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> 11010111100000 => ? = 1 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> 1101011100101000 => ? = 29 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> 110101011010101000 => ? = 17 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 111101100000 => ? = 1 - 1
[]
=> []
=> [1,0]
=> 10 => 0 = 1 - 1
Description
The degree of symmetry of a binary word. For a binary word $w$ of length $n$, this is the number of positions $i\leq n/2$ such that $w_i = w_{n+1-i}$.
Matching statistic: St001722
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00093: Dyck paths to binary wordBinary words
Mp00104: Binary words reverseBinary words
St001722: Binary words ⟶ ℤResult quality: 10% values known / values provided: 10%distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0]
=> 10 => 01 => 1
[2]
=> [1,0,1,0]
=> 1010 => 0101 => 1
[1,1]
=> [1,1,0,0]
=> 1100 => 0011 => 1
[3]
=> [1,0,1,0,1,0]
=> 101010 => 010101 => 1
[2,1]
=> [1,0,1,1,0,0]
=> 101100 => 001101 => 3
[1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 001011 => 1
[4]
=> [1,0,1,0,1,0,1,0]
=> 10101010 => 01010101 => ? = 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 00110101 => ? = 1
[2,2]
=> [1,1,1,0,0,0]
=> 111000 => 000111 => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 00101101 => ? = 5
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 00101011 => ? = 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => 0101010101 => ? = 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => 0011010101 => ? = 5
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 00011101 => ? = 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => 0010110101 => ? = 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 00100111 => ? = 5
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 0010101101 => ? = 7
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 0010101011 => ? = 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 101010101010 => 010101010101 => ? = 3
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 101010101100 => 001101010101 => ? = 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => 0001110101 => ? = 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 101010110100 => 001011010101 => ? = 9
[3,3]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 00010111 => ? = 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => 0010011101 => ? = 3
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => 001010110101 => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 00001111 => ? = 9
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => 0010100111 => ? = 17
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 101101010100 => 001010101101 => ? = 9
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 110101010100 => 001010101011 => ? = 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 10101010101010 => 01010101010101 => ? = 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 10101010101100 => 00110101010101 => ? = 3
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 101010111000 => 000111010101 => ? = 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 10101010110100 => 00101101010101 => ? = 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => 0001011101 => ? = 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 101011100100 => 001001110101 => ? = 7
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 10101011010100 => 00101011010101 => ? = 13
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => 0010010111 => ? = 19
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => 0000111101 => ? = 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => 001010011101 => ? = 5
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> 10101101010100 => 00101010110101 => ? = 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => 0010001111 => ? = 15
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 111001010100 => 001010100111 => ? = 37
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> 10110101010100 => 00101010101101 => ? = 11
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 11010101010100 => 00101010101011 => ? = 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1010101010101010 => 0101010101010101 => ? = 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1010101010101100 => 0011010101010101 => ? = 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 10101010111000 => 00011101010101 => ? = 3
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 1010101010110100 => 0010110101010101 => ? = 3
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 101011101000 => 000101110101 => ? = 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> 10101011100100 => 00100111010101 => ? = 3
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 1010101011010100 => 0010101101010101 => ? = 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 0001010111 => ? = 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 101110100100 => 001001011101 => ? = 5
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 101011110000 => 000011110101 => ? = 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 10101110010100 => 00101001110101 => ? = 29
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> 1010101101010100 => 0010101011010101 => ? = 17
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => 0000110111 => ? = 1
Description
The number of minimal chains with small intervals between a binary word and the top element. A valley in a binary word is a subsequence $01$, or a trailing $0$. A peak is a subsequence $10$ or a trailing $1$. Let $P$ be the lattice on binary words of length $n$, where the covering elements of a word are obtained by replacing a valley with a peak. An interval $[w_1, w_2]$ in $P$ is small if $w_2$ is obtained from $w_1$ by replacing some valleys with peaks. This statistic counts the number of chains $w = w_1 < \dots < w_d = 1\dots 1$ to the top element of minimal length. For example, there are two such chains for the word $0110$: $$ 0110 < 1011 < 1101 < 1110 < 1111 $$ and $$ 0110 < 1010 < 1101 < 1110 < 1111. $$
Matching statistic: St001778
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00146: Dyck paths to tunnel matchingPerfect matchings
Mp00058: Perfect matchings to permutationPermutations
St001778: Permutations ⟶ ℤResult quality: 10% values known / values provided: 10%distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0]
=> [(1,2)]
=> [2,1] => 1
[2]
=> [1,0,1,0]
=> [(1,2),(3,4)]
=> [2,1,4,3] => 1
[1,1]
=> [1,1,0,0]
=> [(1,4),(2,3)]
=> [4,3,2,1] => 1
[3]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> [2,1,4,3,6,5] => 1
[2,1]
=> [1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> [2,1,6,5,4,3] => 3
[1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> [6,3,2,5,4,1] => 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> [2,1,4,3,6,5,8,7] => ? = 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> [2,1,4,3,8,7,6,5] => ? = 1
[2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> [6,5,4,3,2,1] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> [2,1,8,5,4,7,6,3] => ? = 5
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> [8,3,2,5,4,7,6,1] => ? = 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> [2,1,4,3,6,5,8,7,10,9] => ? = 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,10),(8,9)]
=> [2,1,4,3,6,5,10,9,8,7] => ? = 5
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> [2,1,8,7,6,5,4,3] => ? = 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> [2,1,4,3,10,7,6,9,8,5] => ? = 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> [8,5,4,3,2,7,6,1] => ? = 5
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> [2,1,10,5,4,7,6,9,8,3] => ? = 7
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> [10,3,2,5,4,7,6,9,8,1] => ? = 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12)]
=> [2,1,4,3,6,5,8,7,10,9,12,11] => ? = 3
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,12),(10,11)]
=> [2,1,4,3,6,5,8,7,12,11,10,9] => ? = 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,10),(6,9),(7,8)]
=> [2,1,4,3,10,9,8,7,6,5] => ? = 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,12),(8,9),(10,11)]
=> [2,1,4,3,6,5,12,9,8,11,10,7] => ? = 9
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> [8,7,4,3,6,5,2,1] => ? = 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> [2,1,10,7,6,5,4,9,8,3] => ? = 3
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,7),(8,9),(10,11)]
=> [2,1,4,3,12,7,6,9,8,11,10,5] => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> [8,7,6,5,4,3,2,1] => ? = 9
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9)]
=> [10,5,4,3,2,7,6,9,8,1] => ? = 17
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,5),(6,7),(8,9),(10,11)]
=> [2,1,12,5,4,7,6,9,8,11,10,3] => ? = 9
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,12),(2,3),(4,5),(6,7),(8,9),(10,11)]
=> [12,3,2,5,4,7,6,9,8,11,10,1] => ? = 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,14)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,14,13] => ? = 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,14),(12,13)]
=> [2,1,4,3,6,5,8,7,10,9,14,13,12,11] => ? = 3
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,6),(7,12),(8,11),(9,10)]
=> [2,1,4,3,6,5,12,11,10,9,8,7] => ? = 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,14),(10,11),(12,13)]
=> [2,1,4,3,6,5,8,7,14,11,10,13,12,9] => ? = 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,10),(4,9),(5,6),(7,8)]
=> [2,1,10,9,6,5,8,7,4,3] => ? = 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,9),(7,8),(10,11)]
=> [2,1,4,3,12,9,8,7,6,11,10,5] => ? = 7
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,14),(8,9),(10,11),(12,13)]
=> [2,1,4,3,6,5,14,9,8,11,10,13,12,7] => ? = 13
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [(1,10),(2,7),(3,4),(5,6),(8,9)]
=> [10,7,4,3,6,5,2,9,8,1] => ? = 19
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,10),(4,9),(5,8),(6,7)]
=> [2,1,10,9,8,7,6,5,4,3] => ? = 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,7),(5,6),(8,9),(10,11)]
=> [2,1,12,7,6,5,4,9,8,11,10,3] => ? = 5
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,14),(6,7),(8,9),(10,11),(12,13)]
=> [2,1,4,3,14,7,6,9,8,11,10,13,12,5] => ? = 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [(1,10),(2,7),(3,6),(4,5),(8,9)]
=> [10,7,6,5,4,3,2,9,8,1] => ? = 15
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [(1,12),(2,5),(3,4),(6,7),(8,9),(10,11)]
=> [12,5,4,3,2,7,6,9,8,11,10,1] => ? = 37
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,14),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> [2,1,14,5,4,7,6,9,8,11,10,13,12,3] => ? = 11
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,14),(2,3),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> [14,3,2,5,4,7,6,9,8,11,10,13,12,1] => ? = 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,14),(15,16)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,14,13,16,15] => ? = 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,16),(14,15)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,16,15,14,13] => ? = 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,14),(10,13),(11,12)]
=> [2,1,4,3,6,5,8,7,14,13,12,11,10,9] => ? = 3
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,16),(12,13),(14,15)]
=> [2,1,4,3,6,5,8,7,10,9,16,13,12,15,14,11] => ? = 3
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,4),(5,12),(6,11),(7,8),(9,10)]
=> [2,1,4,3,12,11,8,7,10,9,6,5] => ? = 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,14),(8,11),(9,10),(12,13)]
=> [2,1,4,3,6,5,14,11,10,9,8,13,12,7] => ? = 3
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,16),(10,11),(12,13),(14,15)]
=> [2,1,4,3,6,5,8,7,16,11,10,13,12,15,14,9] => ? = 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [(1,10),(2,9),(3,4),(5,6),(7,8)]
=> [10,9,4,3,6,5,8,7,2,1] => ? = 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [(1,2),(3,12),(4,9),(5,6),(7,8),(10,11)]
=> [2,1,12,9,6,5,8,7,4,11,10,3] => ? = 5
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,4),(5,12),(6,11),(7,10),(8,9)]
=> [2,1,4,3,12,11,10,9,8,7,6,5] => ? = 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,14),(6,9),(7,8),(10,11),(12,13)]
=> [2,1,4,3,14,9,8,7,6,11,10,13,12,5] => ? = 29
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,16),(8,9),(10,11),(12,13),(14,15)]
=> [2,1,4,3,6,5,16,9,8,11,10,13,12,15,14,7] => ? = 17
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [(1,10),(2,9),(3,4),(5,8),(6,7)]
=> [10,9,4,3,8,7,6,5,2,1] => ? = 1
Description
The largest greatest common divisor of an element and its image in a permutation.
Matching statistic: St000401
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00146: Dyck paths to tunnel matchingPerfect matchings
Mp00058: Perfect matchings to permutationPermutations
St000401: Permutations ⟶ ℤResult quality: 10% values known / values provided: 10%distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0]
=> [(1,2)]
=> [2,1] => 2 = 1 + 1
[2]
=> [1,0,1,0]
=> [(1,2),(3,4)]
=> [2,1,4,3] => 2 = 1 + 1
[1,1]
=> [1,1,0,0]
=> [(1,4),(2,3)]
=> [4,3,2,1] => 2 = 1 + 1
[3]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> [2,1,4,3,6,5] => 2 = 1 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> [2,1,6,5,4,3] => 4 = 3 + 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> [6,3,2,5,4,1] => 2 = 1 + 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> [2,1,4,3,6,5,8,7] => ? = 1 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> [2,1,4,3,8,7,6,5] => ? = 1 + 1
[2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> [6,5,4,3,2,1] => 2 = 1 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> [2,1,8,5,4,7,6,3] => ? = 5 + 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> [8,3,2,5,4,7,6,1] => ? = 1 + 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> [2,1,4,3,6,5,8,7,10,9] => ? = 1 + 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,10),(8,9)]
=> [2,1,4,3,6,5,10,9,8,7] => ? = 5 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> [2,1,8,7,6,5,4,3] => ? = 1 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> [2,1,4,3,10,7,6,9,8,5] => ? = 1 + 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> [8,5,4,3,2,7,6,1] => ? = 5 + 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> [2,1,10,5,4,7,6,9,8,3] => ? = 7 + 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> [10,3,2,5,4,7,6,9,8,1] => ? = 1 + 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12)]
=> [2,1,4,3,6,5,8,7,10,9,12,11] => ? = 3 + 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,12),(10,11)]
=> [2,1,4,3,6,5,8,7,12,11,10,9] => ? = 1 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,10),(6,9),(7,8)]
=> [2,1,4,3,10,9,8,7,6,5] => ? = 1 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,12),(8,9),(10,11)]
=> [2,1,4,3,6,5,12,9,8,11,10,7] => ? = 9 + 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> [8,7,4,3,6,5,2,1] => ? = 1 + 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> [2,1,10,7,6,5,4,9,8,3] => ? = 3 + 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,7),(8,9),(10,11)]
=> [2,1,4,3,12,7,6,9,8,11,10,5] => ? = 1 + 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> [8,7,6,5,4,3,2,1] => ? = 9 + 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9)]
=> [10,5,4,3,2,7,6,9,8,1] => ? = 17 + 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,5),(6,7),(8,9),(10,11)]
=> [2,1,12,5,4,7,6,9,8,11,10,3] => ? = 9 + 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,12),(2,3),(4,5),(6,7),(8,9),(10,11)]
=> [12,3,2,5,4,7,6,9,8,11,10,1] => ? = 1 + 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,14)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,14,13] => ? = 1 + 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,14),(12,13)]
=> [2,1,4,3,6,5,8,7,10,9,14,13,12,11] => ? = 3 + 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,6),(7,12),(8,11),(9,10)]
=> [2,1,4,3,6,5,12,11,10,9,8,7] => ? = 1 + 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,14),(10,11),(12,13)]
=> [2,1,4,3,6,5,8,7,14,11,10,13,12,9] => ? = 1 + 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,10),(4,9),(5,6),(7,8)]
=> [2,1,10,9,6,5,8,7,4,3] => ? = 1 + 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,9),(7,8),(10,11)]
=> [2,1,4,3,12,9,8,7,6,11,10,5] => ? = 7 + 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,14),(8,9),(10,11),(12,13)]
=> [2,1,4,3,6,5,14,9,8,11,10,13,12,7] => ? = 13 + 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [(1,10),(2,7),(3,4),(5,6),(8,9)]
=> [10,7,4,3,6,5,2,9,8,1] => ? = 19 + 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,10),(4,9),(5,8),(6,7)]
=> [2,1,10,9,8,7,6,5,4,3] => ? = 1 + 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,7),(5,6),(8,9),(10,11)]
=> [2,1,12,7,6,5,4,9,8,11,10,3] => ? = 5 + 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,14),(6,7),(8,9),(10,11),(12,13)]
=> [2,1,4,3,14,7,6,9,8,11,10,13,12,5] => ? = 1 + 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [(1,10),(2,7),(3,6),(4,5),(8,9)]
=> [10,7,6,5,4,3,2,9,8,1] => ? = 15 + 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [(1,12),(2,5),(3,4),(6,7),(8,9),(10,11)]
=> [12,5,4,3,2,7,6,9,8,11,10,1] => ? = 37 + 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,14),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> [2,1,14,5,4,7,6,9,8,11,10,13,12,3] => ? = 11 + 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,14),(2,3),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> [14,3,2,5,4,7,6,9,8,11,10,13,12,1] => ? = 1 + 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,14),(15,16)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,14,13,16,15] => ? = 1 + 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12),(13,16),(14,15)]
=> [2,1,4,3,6,5,8,7,10,9,12,11,16,15,14,13] => ? = 1 + 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,14),(10,13),(11,12)]
=> [2,1,4,3,6,5,8,7,14,13,12,11,10,9] => ? = 3 + 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10),(11,16),(12,13),(14,15)]
=> [2,1,4,3,6,5,8,7,10,9,16,13,12,15,14,11] => ? = 3 + 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,4),(5,12),(6,11),(7,8),(9,10)]
=> [2,1,4,3,12,11,8,7,10,9,6,5] => ? = 1 + 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,14),(8,11),(9,10),(12,13)]
=> [2,1,4,3,6,5,14,11,10,9,8,13,12,7] => ? = 3 + 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,16),(10,11),(12,13),(14,15)]
=> [2,1,4,3,6,5,8,7,16,11,10,13,12,15,14,9] => ? = 1 + 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [(1,10),(2,9),(3,4),(5,6),(7,8)]
=> [10,9,4,3,6,5,8,7,2,1] => ? = 1 + 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [(1,2),(3,12),(4,9),(5,6),(7,8),(10,11)]
=> [2,1,12,9,6,5,8,7,4,11,10,3] => ? = 5 + 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,4),(5,12),(6,11),(7,10),(8,9)]
=> [2,1,4,3,12,11,10,9,8,7,6,5] => ? = 1 + 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,14),(6,9),(7,8),(10,11),(12,13)]
=> [2,1,4,3,14,9,8,7,6,11,10,13,12,5] => ? = 29 + 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,16),(8,9),(10,11),(12,13),(14,15)]
=> [2,1,4,3,6,5,16,9,8,11,10,13,12,15,14,7] => ? = 17 + 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [(1,10),(2,9),(3,4),(5,8),(6,7)]
=> [10,9,4,3,8,7,6,5,2,1] => ? = 1 + 1
Description
The size of the symmetry class of a permutation. The symmetry class of a permutation $\pi$ is the set of all permutations that can be obtained from $\pi$ by the three elementary operations '''inverse''' ([[Mp00066]]), '''reverse''' ([[Mp00064]]), and '''complement''' ([[Mp00069]]). Two elements in the same symmetry class are also in the same Wilf-equivalence class, see for example [2].
Matching statistic: St001207
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00223: Permutations runsortPermutations
St001207: Permutations ⟶ ℤResult quality: 10% values known / values provided: 10%distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0]
=> [2,1] => [1,2] => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [3,1,2] => [1,2,3] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [2,3,1] => [1,2,3] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => [1,2,3,4] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => [1,4,2,3] => 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => [1,2,3,4] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,2,3,4,5] => ? = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [1,2,5,3,4] => ? = 1 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [1,4,2,3,5] => ? = 5 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [1,2,3,4,5] => ? = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,2,3,4,5,6] => ? = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [1,2,3,6,4,5] => ? = 5 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [1,4,5,2,3] => ? = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [1,2,5,3,4,6] => ? = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [1,3,2,5,4] => ? = 5 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [1,5,2,3,4,6] => ? = 7 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [1,2,3,4,5,6] => ? = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,1,2,3,4,5,6] => [1,2,3,4,5,6,7] => ? = 3 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [6,1,2,3,4,7,5] => [1,2,3,4,7,5,6] => ? = 1 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [1,2,5,6,3,4] => ? = 1 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [7,1,2,3,6,4,5] => [1,2,3,6,4,5,7] => ? = 9 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [1,2,3,4,5] => ? = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [1,6,2,4,3,5] => ? = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [7,1,2,6,3,4,5] => [1,2,6,3,4,5,7] => ? = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => ? = 9 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [1,3,4,2,6,5] => ? = 17 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => [1,7,2,3,4,5,6] => ? = 9 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => [1,2,3,4,5,6,7] => ? = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [8,1,2,3,4,5,6,7] => [1,2,3,4,5,6,7,8] => ? = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [7,1,2,3,4,5,8,6] => [1,2,3,4,5,8,6,7] => ? = 3 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,1,2,3,6,7,4] => [1,2,3,6,7,4,5] => ? = 1 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [8,1,2,3,4,7,5,6] => [1,2,3,4,7,5,6,8] => ? = 1 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [1,4,5,2,3,6] => ? = 1 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [4,1,2,7,6,3,5] => [1,2,7,3,5,4,6] => ? = 7 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [8,1,2,3,7,4,5,6] => [1,2,3,7,4,5,6,8] => ? = 13 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [1,2,4,3,5,6] => ? = 19 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [1,4,5,6,2,3] => ? = 1 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [3,1,7,6,2,4,5] => [1,7,2,4,5,3,6] => ? = 5 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [7,1,2,8,3,4,5,6] => [1,2,8,3,4,5,6,7] => ? = 1 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [1,4,2,3,6,5] => ? = 15 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [2,6,7,1,3,4,5] => [1,3,4,5,2,6,7] => ? = 37 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [8,1,7,2,3,4,5,6] => [1,7,2,3,4,5,6,8] => ? = 11 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,7,1,2,3,4,5,6] => [1,2,3,4,5,6,7,8] => ? = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [9,1,2,3,4,5,6,7,8] => [1,2,3,4,5,6,7,8,9] => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [8,1,2,3,4,5,6,9,7] => [1,2,3,4,5,6,9,7,8] => ? = 1 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [6,1,2,3,4,7,8,5] => [1,2,3,4,7,8,5,6] => ? = 3 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [9,1,2,3,4,5,8,6,7] => [1,2,3,4,5,8,6,7,9] => ? = 3 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [7,1,2,5,6,3,4] => [1,2,5,6,3,4,7] => ? = 1 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [5,1,2,3,8,7,4,6] => [1,2,3,8,4,6,5,7] => ? = 3 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [9,1,2,3,4,8,5,6,7] => [1,2,3,4,8,5,6,7,9] => ? = 1 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [1,2,3,4,5,6] => ? = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [7,1,4,6,2,3,5] => [1,4,6,2,3,5,7] => ? = 5 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [4,1,2,5,6,7,3] => [1,2,5,6,7,3,4] => ? = 1 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [4,1,2,8,7,3,5,6] => [1,2,8,3,5,6,4,7] => ? = 29 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [8,1,2,3,9,4,5,6,7] => [1,2,3,9,4,5,6,7,8] => ? = 17 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [1,6,2,3,4,5] => ? = 1 - 1
Description
The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.