Your data matches 35 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001174: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 0
[2,1,3] => 0
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 0
[1,3,2,4] => 0
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 0
[2,1,3,4] => 0
[2,1,4,3] => 0
[2,3,1,4] => 1
[2,3,4,1] => 1
[2,4,1,3] => 1
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 1
[3,2,1,4] => 0
[3,2,4,1] => 1
[3,4,1,2] => 1
[3,4,2,1] => 1
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 0
[1,2,3,5,4] => 0
[1,2,4,3,5] => 0
[1,2,4,5,3] => 1
[1,2,5,3,4] => 1
[1,2,5,4,3] => 0
[1,3,2,4,5] => 0
[1,3,2,5,4] => 0
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 1
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 1
[1,4,3,2,5] => 0
[1,4,3,5,2] => 1
[1,4,5,2,3] => 1
[1,4,5,3,2] => 1
Description
The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
Mp00238: Permutations Clarke-Steingrimsson-ZengPermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [1,2] => [1,0,1,0]
=> 1 = 0 + 1
[2,1] => [2,1] => [1,1,0,0]
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 1 = 0 + 1
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 1 = 0 + 1
[2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> 2 = 1 + 1
[3,1,2] => [3,1,2] => [1,1,1,0,0,0]
=> 2 = 1 + 1
[3,2,1] => [2,3,1] => [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,3,4,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,2,3] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,3,2] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[2,3,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[2,3,4,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[2,4,1,3] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[2,4,3,1] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[3,1,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[3,1,4,2] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[3,2,1,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[3,2,4,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[3,4,1,2] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[3,4,2,1] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[4,1,2,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[4,1,3,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,2,1,3] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[4,2,3,1] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,1,2] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[4,3,2,1] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,2,4,5,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,2,5,3,4] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,2,5,4,3] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,3,4,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,5,2] => [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,3,5,2,4] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,3,5,4,2] => [1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,4,2,3,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,4,2,5,3] => [1,5,4,2,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,3,2,5] => [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,4,3,5,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,5,2,3] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,5,3,2] => [1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
Description
The logarithmic height of a Dyck path. This is the floor of the binary logarithm of the usual height increased by one: $$ \lfloor\log_2(1+height(D))\rfloor $$
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00109: Permutations descent wordBinary words
St000392: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => 0 => 0
[2,1] => [1,2] => [1,2] => 0 => 0
[1,2,3] => [3,2,1] => [1,2,3] => 00 => 0
[1,3,2] => [3,1,2] => [1,2,3] => 00 => 0
[2,1,3] => [2,3,1] => [1,2,3] => 00 => 0
[2,3,1] => [2,1,3] => [1,3,2] => 01 => 1
[3,1,2] => [1,3,2] => [1,3,2] => 01 => 1
[3,2,1] => [1,2,3] => [1,2,3] => 00 => 0
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => 000 => 0
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => 000 => 0
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => 000 => 0
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => 010 => 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => 010 => 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => 000 => 0
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => 000 => 0
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => 000 => 0
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => 001 => 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => 010 => 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => 010 => 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => 001 => 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => 001 => 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => 010 => 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => 000 => 0
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => 010 => 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => 010 => 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => 001 => 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => 010 => 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => 001 => 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => 010 => 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => 001 => 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 000 => 0
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => 0000 => 0
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => 0000 => 0
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => 0000 => 0
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => 0100 => 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => 0100 => 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => 0000 => 0
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => 0000 => 0
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => 0000 => 0
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => 0010 => 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => 0100 => 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => 0100 => 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => 0010 => 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => 0010 => 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => 0100 => 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => 0000 => 0
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => 0100 => 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => 0100 => 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => 0010 => 1
Description
The length of the longest run of ones in a binary word.
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00204: Permutations LLPSInteger partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => [1,1]
=> 0
[2,1] => [1,2] => [1,2] => [1,1]
=> 0
[1,2,3] => [3,2,1] => [1,2,3] => [1,1,1]
=> 0
[1,3,2] => [3,1,2] => [1,2,3] => [1,1,1]
=> 0
[2,1,3] => [2,3,1] => [1,2,3] => [1,1,1]
=> 0
[2,3,1] => [2,1,3] => [1,3,2] => [2,1]
=> 1
[3,1,2] => [1,3,2] => [1,3,2] => [2,1]
=> 1
[3,2,1] => [1,2,3] => [1,2,3] => [1,1,1]
=> 0
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => [2,1,1]
=> 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => [2,1,1]
=> 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => [2,1,1]
=> 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => [2,1,1]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => [2,1,1]
=> 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => [2,1,1]
=> 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => [2,1,1]
=> 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => [2,1,1]
=> 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => [2,1,1]
=> 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => [2,1,1]
=> 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => [2,1,1]
=> 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => [2,1,1]
=> 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => [2,1,1]
=> 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => [2,1,1]
=> 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => [2,1,1]
=> 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => [2,1,1,1]
=> 1
Description
The number of lower covers of a partition in dominance order. According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is $$ \frac{1}{2}(\sqrt{1+8n}-3) $$ and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00109: Permutations descent wordBinary words
St000628: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => 0 => 0
[2,1] => [1,2] => [1,2] => 0 => 0
[1,2,3] => [3,2,1] => [1,2,3] => 00 => 0
[1,3,2] => [3,1,2] => [1,2,3] => 00 => 0
[2,1,3] => [2,3,1] => [1,2,3] => 00 => 0
[2,3,1] => [2,1,3] => [1,3,2] => 01 => 1
[3,1,2] => [1,3,2] => [1,3,2] => 01 => 1
[3,2,1] => [1,2,3] => [1,2,3] => 00 => 0
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => 000 => 0
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => 000 => 0
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => 000 => 0
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => 010 => 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => 010 => 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => 000 => 0
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => 000 => 0
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => 000 => 0
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => 001 => 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => 010 => 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => 010 => 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => 001 => 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => 001 => 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => 010 => 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => 000 => 0
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => 010 => 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => 010 => 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => 001 => 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => 010 => 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => 001 => 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => 010 => 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => 001 => 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 000 => 0
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => 0000 => 0
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => 0000 => 0
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => 0000 => 0
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => 0100 => 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => 0100 => 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => 0000 => 0
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => 0000 => 0
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => 0000 => 0
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => 0010 => 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => 0100 => 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => 0100 => 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => 0010 => 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => 0010 => 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => 0100 => 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => 0000 => 0
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => 0100 => 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => 0100 => 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => 0010 => 1
Description
The balance of a binary word. The balance of a word is the smallest number $q$ such that the word is $q$-balanced [1]. A binary word $w$ is $q$-balanced if for any two factors $u$, $v$ of $w$ of the same length, the difference between the number of ones in $u$ and $v$ is at most $q$.
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00204: Permutations LLPSInteger partitions
St001124: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => [1,1]
=> 0
[2,1] => [1,2] => [1,2] => [1,1]
=> 0
[1,2,3] => [3,2,1] => [1,2,3] => [1,1,1]
=> 0
[1,3,2] => [3,1,2] => [1,2,3] => [1,1,1]
=> 0
[2,1,3] => [2,3,1] => [1,2,3] => [1,1,1]
=> 0
[2,3,1] => [2,1,3] => [1,3,2] => [2,1]
=> 1
[3,1,2] => [1,3,2] => [1,3,2] => [2,1]
=> 1
[3,2,1] => [1,2,3] => [1,2,3] => [1,1,1]
=> 0
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => [2,1,1]
=> 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => [2,1,1]
=> 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => [1,1,1,1]
=> 0
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => [2,1,1]
=> 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => [2,1,1]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => [2,1,1]
=> 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => [2,1,1]
=> 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => [2,1,1]
=> 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 0
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => [2,1,1]
=> 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => [2,1,1]
=> 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => [2,1,1]
=> 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => [2,1,1]
=> 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => [2,1,1]
=> 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => [2,1,1]
=> 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => [2,1,1]
=> 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => [2,1,1]
=> 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 0
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => [2,1,1,1]
=> 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => [2,1,1,1]
=> 1
Description
The multiplicity of the standard representation in the Kronecker square corresponding to a partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{(n-1)1}$, for $\lambda\vdash n > 1$. For $n\leq1$ the statistic is undefined. It follows from [3, Prop.4.1] (or, slightly easier from [3, Thm.4.2]) that this is one less than [[St000159]], the number of distinct parts of the partition.
Mp00064: Permutations reversePermutations
Mp00223: Permutations runsortPermutations
Mp00062: Permutations Lehmer-code to major-code bijectionPermutations
St001859: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => [1,2] => 0
[2,1] => [1,2] => [1,2] => [1,2] => 0
[1,2,3] => [3,2,1] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [2,3,1] => [1,2,3] => [1,2,3] => 0
[2,1,3] => [3,1,2] => [1,2,3] => [1,2,3] => 0
[2,3,1] => [1,3,2] => [1,3,2] => [3,1,2] => 1
[3,1,2] => [2,1,3] => [1,3,2] => [3,1,2] => 1
[3,2,1] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [3,4,2,1] => [1,2,3,4] => [1,2,3,4] => 0
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => [1,2,3,4] => 0
[1,3,4,2] => [2,4,3,1] => [1,2,4,3] => [4,1,2,3] => 1
[1,4,2,3] => [3,2,4,1] => [1,2,4,3] => [4,1,2,3] => 1
[1,4,3,2] => [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
[2,1,3,4] => [4,3,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[2,3,1,4] => [4,1,3,2] => [1,3,2,4] => [3,1,2,4] => 1
[2,3,4,1] => [1,4,3,2] => [1,4,2,3] => [3,4,1,2] => 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => [3,4,1,2] => 1
[2,4,3,1] => [1,3,4,2] => [1,3,4,2] => [2,4,1,3] => 1
[3,1,2,4] => [4,2,1,3] => [1,3,2,4] => [3,1,2,4] => 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => [3,1,2,4] => 1
[3,2,1,4] => [4,1,2,3] => [1,2,3,4] => [1,2,3,4] => 0
[3,2,4,1] => [1,4,2,3] => [1,4,2,3] => [3,4,1,2] => 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => [3,4,1,2] => 1
[3,4,2,1] => [1,2,4,3] => [1,2,4,3] => [4,1,2,3] => 1
[4,1,2,3] => [3,2,1,4] => [1,4,2,3] => [3,4,1,2] => 1
[4,1,3,2] => [2,3,1,4] => [1,4,2,3] => [3,4,1,2] => 1
[4,2,1,3] => [3,1,2,4] => [1,2,4,3] => [4,1,2,3] => 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => [3,1,2,4] => 1
[4,3,1,2] => [2,1,3,4] => [1,3,4,2] => [2,4,1,3] => 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [4,5,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,4,3,5] => [5,3,4,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,4,5,3] => [3,5,4,2,1] => [1,2,3,5,4] => [5,1,2,3,4] => 1
[1,2,5,3,4] => [4,3,5,2,1] => [1,2,3,5,4] => [5,1,2,3,4] => 1
[1,2,5,4,3] => [3,4,5,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,3,2,4,5] => [5,4,2,3,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,3,2,5,4] => [4,5,2,3,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,3,4,2,5] => [5,2,4,3,1] => [1,2,4,3,5] => [4,1,2,3,5] => 1
[1,3,4,5,2] => [2,5,4,3,1] => [1,2,5,3,4] => [4,5,1,2,3] => 1
[1,3,5,2,4] => [4,2,5,3,1] => [1,2,5,3,4] => [4,5,1,2,3] => 1
[1,3,5,4,2] => [2,4,5,3,1] => [1,2,4,5,3] => [3,5,1,2,4] => 1
[1,4,2,3,5] => [5,3,2,4,1] => [1,2,4,3,5] => [4,1,2,3,5] => 1
[1,4,2,5,3] => [3,5,2,4,1] => [1,2,4,3,5] => [4,1,2,3,5] => 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,4,3,5,2] => [2,5,3,4,1] => [1,2,5,3,4] => [4,5,1,2,3] => 1
[1,4,5,2,3] => [3,2,5,4,1] => [1,2,5,3,4] => [4,5,1,2,3] => 1
[1,4,5,3,2] => [2,3,5,4,1] => [1,2,3,5,4] => [5,1,2,3,4] => 1
Description
The number of factors of the Stanley symmetric function associated with a permutation. For example, the Stanley symmetric function of $\pi=321645$ equals $20 m_{1,1,1,1,1} + 11 m_{2,1,1,1} + 6 m_{2,2,1} + 4 m_{3,1,1} + 2 m_{3,2} + m_{4,1} = (m_{1,1} + m_{2})(2 m_{1,1,1} + m_{2,1}).$
Mp00064: Permutations reversePermutations
Mp00223: Permutations runsortPermutations
Mp00159: Permutations Demazure product with inversePermutations
St000058: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => [1,2] => 1 = 0 + 1
[2,1] => [1,2] => [1,2] => [1,2] => 1 = 0 + 1
[1,2,3] => [3,2,1] => [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,3,2] => [2,3,1] => [1,2,3] => [1,2,3] => 1 = 0 + 1
[2,1,3] => [3,1,2] => [1,2,3] => [1,2,3] => 1 = 0 + 1
[2,3,1] => [1,3,2] => [1,3,2] => [1,3,2] => 2 = 1 + 1
[3,1,2] => [2,1,3] => [1,3,2] => [1,3,2] => 2 = 1 + 1
[3,2,1] => [1,2,3] => [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,2,4,3] => [3,4,2,1] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,3,4,2] => [2,4,3,1] => [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[1,4,2,3] => [3,2,4,1] => [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[1,4,3,2] => [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[2,1,3,4] => [4,3,1,2] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[2,3,1,4] => [4,1,3,2] => [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[2,3,4,1] => [1,4,3,2] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[2,4,3,1] => [1,3,4,2] => [1,3,4,2] => [1,4,3,2] => 2 = 1 + 1
[3,1,2,4] => [4,2,1,3] => [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[3,2,1,4] => [4,1,2,3] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[3,2,4,1] => [1,4,2,3] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[3,4,2,1] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[4,1,2,3] => [3,2,1,4] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[4,1,3,2] => [2,3,1,4] => [1,4,2,3] => [1,4,3,2] => 2 = 1 + 1
[4,2,1,3] => [3,1,2,4] => [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[4,3,1,2] => [2,1,3,4] => [1,3,4,2] => [1,4,3,2] => 2 = 1 + 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,2,3,5,4] => [4,5,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,2,4,3,5] => [5,3,4,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,2,4,5,3] => [3,5,4,2,1] => [1,2,3,5,4] => [1,2,3,5,4] => 2 = 1 + 1
[1,2,5,3,4] => [4,3,5,2,1] => [1,2,3,5,4] => [1,2,3,5,4] => 2 = 1 + 1
[1,2,5,4,3] => [3,4,5,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,3,2,4,5] => [5,4,2,3,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,3,2,5,4] => [4,5,2,3,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,3,4,2,5] => [5,2,4,3,1] => [1,2,4,3,5] => [1,2,4,3,5] => 2 = 1 + 1
[1,3,4,5,2] => [2,5,4,3,1] => [1,2,5,3,4] => [1,2,5,4,3] => 2 = 1 + 1
[1,3,5,2,4] => [4,2,5,3,1] => [1,2,5,3,4] => [1,2,5,4,3] => 2 = 1 + 1
[1,3,5,4,2] => [2,4,5,3,1] => [1,2,4,5,3] => [1,2,5,4,3] => 2 = 1 + 1
[1,4,2,3,5] => [5,3,2,4,1] => [1,2,4,3,5] => [1,2,4,3,5] => 2 = 1 + 1
[1,4,2,5,3] => [3,5,2,4,1] => [1,2,4,3,5] => [1,2,4,3,5] => 2 = 1 + 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,4,3,5,2] => [2,5,3,4,1] => [1,2,5,3,4] => [1,2,5,4,3] => 2 = 1 + 1
[1,4,5,2,3] => [3,2,5,4,1] => [1,2,5,3,4] => [1,2,5,4,3] => 2 = 1 + 1
[1,4,5,3,2] => [2,3,5,4,1] => [1,2,3,5,4] => [1,2,3,5,4] => 2 = 1 + 1
Description
The order of a permutation. $\operatorname{ord}(\pi)$ is given by the minimial $k$ for which $\pi^k$ is the identity permutation.
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00204: Permutations LLPSInteger partitions
St000159: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => [1,1]
=> 1 = 0 + 1
[2,1] => [1,2] => [1,2] => [1,1]
=> 1 = 0 + 1
[1,2,3] => [3,2,1] => [1,2,3] => [1,1,1]
=> 1 = 0 + 1
[1,3,2] => [3,1,2] => [1,2,3] => [1,1,1]
=> 1 = 0 + 1
[2,1,3] => [2,3,1] => [1,2,3] => [1,1,1]
=> 1 = 0 + 1
[2,3,1] => [2,1,3] => [1,3,2] => [2,1]
=> 2 = 1 + 1
[3,1,2] => [1,3,2] => [1,3,2] => [2,1]
=> 2 = 1 + 1
[3,2,1] => [1,2,3] => [1,2,3] => [1,1,1]
=> 1 = 0 + 1
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => [2,1,1]
=> 2 = 1 + 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => [2,1,1]
=> 2 = 1 + 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => [2,1,1]
=> 2 = 1 + 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => [2,1,1]
=> 2 = 1 + 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 2 = 1 + 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => [2,1,1]
=> 2 = 1 + 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => [2,1,1]
=> 2 = 1 + 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => [2,1,1]
=> 2 = 1 + 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => [2,1,1]
=> 2 = 1 + 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => [2,1,1]
=> 2 = 1 + 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => [2,1,1]
=> 2 = 1 + 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 1 = 0 + 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1 = 0 + 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => [2,1,1,1]
=> 2 = 1 + 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => [2,1,1,1]
=> 2 = 1 + 1
Description
The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.
Mp00069: Permutations complementPermutations
Mp00223: Permutations runsortPermutations
Mp00065: Permutations permutation posetPosets
St000298: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,2] => ([(0,1)],2)
=> 1 = 0 + 1
[2,1] => [1,2] => [1,2] => ([(0,1)],2)
=> 1 = 0 + 1
[1,2,3] => [3,2,1] => [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,2] => [3,1,2] => [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,3] => [2,3,1] => [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,3,1] => [2,1,3] => [1,3,2] => ([(0,1),(0,2)],3)
=> 2 = 1 + 1
[3,1,2] => [1,3,2] => [1,3,2] => ([(0,1),(0,2)],3)
=> 2 = 1 + 1
[3,2,1] => [1,2,3] => [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,3,4] => [4,3,2,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[1,2,4,3] => [4,3,1,2] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[1,3,2,4] => [4,2,3,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[1,3,4,2] => [4,2,1,3] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,2,3] => [4,1,3,2] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,3,2] => [4,1,2,3] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[2,1,3,4] => [3,4,2,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[2,1,4,3] => [3,4,1,2] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[2,3,1,4] => [3,2,4,1] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 2 = 1 + 1
[2,3,4,1] => [3,2,1,4] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[2,4,1,3] => [3,1,4,2] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[2,4,3,1] => [3,1,2,4] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 2 = 1 + 1
[3,1,2,4] => [2,4,3,1] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 2 = 1 + 1
[3,1,4,2] => [2,4,1,3] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,1,4] => [2,3,4,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[3,2,4,1] => [2,3,1,4] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[3,4,1,2] => [2,1,4,3] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[3,4,2,1] => [2,1,3,4] => [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[4,1,2,3] => [1,4,3,2] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[4,1,3,2] => [1,4,2,3] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[4,2,1,3] => [1,3,4,2] => [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 2 = 1 + 1
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,1,2] => [1,2,4,3] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 2 = 1 + 1
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,2,3,5,4] => [5,4,3,1,2] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2 = 1 + 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2 = 1 + 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,3,4,2,5] => [5,3,2,4,1] => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2 = 1 + 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 1 + 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 1 + 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2 = 1 + 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2 = 1 + 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2 = 1 + 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 1 + 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 1 + 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 1 + 1
Description
The order dimension or Dushnik-Miller dimension of a poset. This is the minimal number of linear orderings whose intersection is the given poset.
The following 25 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000308The height of the tree associated to a permutation. St000396The register function (or Horton-Strahler number) of a binary tree. St000485The length of the longest cycle of a permutation. St000783The side length of the largest staircase partition fitting into a partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001432The order dimension of the partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St000264The girth of a graph, which is not a tree. St000259The diameter of a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St000456The monochromatic index of a connected graph. St000260The radius of a connected graph. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000640The rank of the largest boolean interval in a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St001060The distinguishing index of a graph. St000307The number of rowmotion orbits of a poset. St000699The toughness times the least common multiple of 1,. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000454The largest eigenvalue of a graph if it is integral. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001823The Stasinski-Voll length of a signed permutation. St001946The number of descents in a parking function.