Your data matches 78 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000380
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00204: Permutations LLPSInteger partitions
St000380: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 2
[1,0,1,0]
=> [1,2] => [1,2] => [1,1]
=> 3
[1,1,0,0]
=> [2,1] => [1,2] => [1,1]
=> 3
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 4
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,1,1]
=> 4
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,1,1]
=> 4
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 4
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,1,1]
=> 4
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 5
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [2,1,1]
=> 4
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,1,1]
=> 4
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => [2,1,1]
=> 4
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [2,1,1]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,1,1,1]
=> 5
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,1,1,1]
=> 5
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,1,1,1]
=> 5
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => [2,1,1,1]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,1,1,1]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 5
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 6
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,1,1,1]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,1,1,1]
=> 5
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,1,1,1]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,1,1,1]
=> 5
Description
Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. Put differently, this is the smallest number $n$ such that the partition fits into the triangular partition $(n-1,n-2,\dots,1)$.
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00204: Permutations LLPSInteger partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [2,1,1]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
Description
The length of the partition.
Matching statistic: St000384
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00204: Permutations LLPSInteger partitions
St000384: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [2,1,1]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
Description
The maximal part of the shifted composition of an integer partition. A partition $\lambda = (\lambda_1,\ldots,\lambda_k)$ is shifted into a composition by adding $i-1$ to the $i$-th part. The statistic is then $\operatorname{max}_i\{ \lambda_i + i - 1 \}$. See also [[St000380]].
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00070: Permutations Robinson-Schensted recording tableauStandard tableaux
St000507: Standard tableaux ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [[1]]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [[1,2]]
=> 2 = 3 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [[1,2]]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [[1,2,3]]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [[1,2,3]]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [[1,2,3]]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [[1,2,3]]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [[1,2],[3]]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [[1,2,3],[4]]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [[1,2,3],[4]]
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [[1,2,4],[3]]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [[1,2,3],[4]]
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => [[1,2,4],[3]]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [[1,2,4],[3]]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [[1,2,3,4],[5]]
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [[1,2,3,5],[4]]
=> 4 = 5 - 1
Description
The number of ascents of a standard tableau. Entry $i$ of a standard Young tableau is an '''ascent''' if $i+1$ appears to the right or above $i$ in the tableau (with respect to the English notation for tableaux).
Matching statistic: St000784
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00204: Permutations LLPSInteger partitions
St000784: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => [2,1,1]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [2,1,1]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => [2,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,1,1,1]
=> 4 = 5 - 1
Description
The maximum of the length and the largest part of the integer partition. This is the side length of the smallest square the Ferrers diagram of the partition fits into. It is also the minimal number of colours required to colour the cells of the Ferrers diagram such that no two cells in a column or in a row have the same colour, see [1]. See also [[St001214]].
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00109: Permutations descent wordBinary words
St000393: Binary words ⟶ ℤResult quality: 86% values known / values provided: 100%distinct values known / distinct values provided: 86%
Values
[1,0]
=> [1] => [1] => => ? = 2 - 2
[1,0,1,0]
=> [1,2] => [1,2] => 0 => 1 = 3 - 2
[1,1,0,0]
=> [2,1] => [1,2] => 0 => 1 = 3 - 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 00 => 2 = 4 - 2
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 00 => 2 = 4 - 2
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 00 => 2 = 4 - 2
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 00 => 2 = 4 - 2
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 01 => 1 = 3 - 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 001 => 2 = 4 - 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 000 => 3 = 5 - 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 001 => 2 = 4 - 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 010 => 2 = 4 - 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 001 => 2 = 4 - 2
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,3,2,4] => 010 => 2 = 4 - 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 010 => 2 = 4 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 0001 => 3 = 5 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 0001 => 3 = 5 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => 0010 => 3 = 5 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => 0001 => 3 = 5 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,2,4,3,5] => 0010 => 3 = 5 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => 0010 => 3 = 5 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => 0001 => 3 = 5 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 0000 => 4 = 6 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => 0001 => 3 = 5 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => 0010 => 3 = 5 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 0001 => 3 = 5 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [1,2,4,3,5] => 0010 => 3 = 5 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 3 = 5 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => 0100 => 3 = 5 - 2
Description
The number of strictly increasing runs in a binary word.
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00002: Alternating sign matrices to left key permutationPermutations
Mp00252: Permutations restrictionPermutations
St000062: Permutations ⟶ ℤResult quality: 86% values known / values provided: 100%distinct values known / distinct values provided: 86%
Values
[1,0]
=> [[1]]
=> [1] => [] => ? = 2 - 2
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => [1] => 1 = 3 - 2
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => [1] => 1 = 3 - 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => [1,2] => 2 = 4 - 2
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => [2,1] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => [1,2] => 2 = 4 - 2
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => [2,1,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => [3,1,2] => 2 = 4 - 2
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => [2,1,4,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,1,2,4,5] => [3,1,2,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ? => ? = 6 - 2
Description
The length of the longest increasing subsequence of the permutation.
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00002: Alternating sign matrices to left key permutationPermutations
Mp00252: Permutations restrictionPermutations
St000308: Permutations ⟶ ℤResult quality: 86% values known / values provided: 100%distinct values known / distinct values provided: 86%
Values
[1,0]
=> [[1]]
=> [1] => [] => ? = 2 - 2
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => [1] => 1 = 3 - 2
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => [1] => 1 = 3 - 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => [1,2] => 2 = 4 - 2
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => [2,1] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => [1,2] => 2 = 4 - 2
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => [2,1,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => [3,1,2] => 2 = 4 - 2
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => [2,1,4,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,1,2,4,5] => [3,1,2,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ? => ? = 6 - 2
Description
The height of the tree associated to a permutation. A permutation can be mapped to a rooted tree with vertices $\{0,1,2,\ldots,n\}$ and root $0$ in the following way. Entries of the permutations are inserted one after the other, each child is larger than its parent and the children are in strict order from left to right. Details of the construction are found in [1]. The statistic is given by the height of this tree. See also [[St000325]] for the width of this tree.
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00002: Alternating sign matrices to left key permutationPermutations
Mp00252: Permutations restrictionPermutations
St000991: Permutations ⟶ ℤResult quality: 86% values known / values provided: 100%distinct values known / distinct values provided: 86%
Values
[1,0]
=> [[1]]
=> [1] => [] => ? = 2 - 2
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => [1] => 1 = 3 - 2
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => [1] => 1 = 3 - 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => [1,2] => 2 = 4 - 2
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => [2,1] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => [1,2] => 2 = 4 - 2
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => [2,1,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => [3,1,2] => 2 = 4 - 2
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => [2,1,4,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,1,2,4,5] => [3,1,2,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ? => ? = 6 - 2
Description
The number of right-to-left minima of a permutation. For the number of left-to-right maxima, see [[St000314]].
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00002: Alternating sign matrices to left key permutationPermutations
Mp00252: Permutations restrictionPermutations
St000702: Permutations ⟶ ℤResult quality: 86% values known / values provided: 99%distinct values known / distinct values provided: 86%
Values
[1,0]
=> [[1]]
=> [1] => [] => ? = 2 - 2
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => [1] => ? ∊ {3,3} - 2
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => [1] => ? ∊ {3,3} - 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => [1,2] => 2 = 4 - 2
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => [2,1] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => [1,2] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => [1,2] => 2 = 4 - 2
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => [2,1,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [1,3,2] => 2 = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => [3,1,2] => 2 = 4 - 2
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,3] => 2 = 4 - 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => [1,2,3] => 3 = 5 - 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => [1,2,3] => 3 = 5 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => [2,1,4,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,3,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => [1,2,4,3] => 3 = 5 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => [1,4,2,3] => 3 = 5 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,3,2,4] => 3 = 5 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => [1,2,3,4] => 4 = 6 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,1,2,4,5] => [3,1,2,4] => 3 = 5 - 2
[1,1,1,0,0,0,1,1,0,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [3,1,2,5,4] => [3,1,2,4] => 3 = 5 - 2
[1,1,1,0,0,1,0,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => [2,1,4,3] => 2 = 4 - 2
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ? => ? = 6 - 2
Description
The number of weak deficiencies of a permutation. This is defined as $$\operatorname{wdec}(\sigma)=\#\{i:\sigma(i) \leq i\}.$$ The number of weak exceedances is [[St000213]], the number of deficiencies is [[St000703]].
The following 68 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St000245The number of ascents of a permutation. St000459The hook length of the base cell of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001298The number of repeated entries in the Lehmer code of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000619The number of cyclic descents of a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000213The number of weak exceedances (also weak excedences) of a permutation. St000325The width of the tree associated to a permutation. St000470The number of runs in a permutation. St000863The length of the first row of the shifted shape of a permutation. St000021The number of descents of a permutation. St000552The number of cut vertices of a graph. St001692The number of vertices with higher degree than the average degree in a graph. St000083The number of left oriented leafs of a binary tree except the first one. St000354The number of recoils of a permutation. St001720The minimal length of a chain of small intervals in a lattice. St001820The size of the image of the pop stack sorting operator. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001645The pebbling number of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001626The number of maximal proper sublattices of a lattice. St000907The number of maximal antichains of minimal length in a poset. St000783The side length of the largest staircase partition fitting into a partition. St000031The number of cycles in the cycle decomposition of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001649The length of a longest trail in a graph. St001668The number of points of the poset minus the width of the poset. St001960The number of descents of a permutation minus one if its first entry is not one. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001863The number of weak excedances of a signed permutation. St000717The number of ordinal summands of a poset. St001497The position of the largest weak excedence of a permutation. St000050The depth or height of a binary tree. St000216The absolute length of a permutation. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001965The number of decreasable positions in the corner sum matrix of an alternating sign matrix. St000144The pyramid weight of the Dyck path. St000519The largest length of a factor maximising the subword complexity. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000922The minimal number such that all substrings of this length are unique. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001424The number of distinct squares in a binary word. St001432The order dimension of the partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St000291The number of descents of a binary word. St000390The number of runs of ones in a binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001777The number of weak descents in an integer composition. St001935The number of ascents in a parking function. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001207The 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)$.