Your data matches 286 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000032: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 1 = 0 + 1
[1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
Description
The number of elements smaller than the given Dyck path in the Tamari Order.
Mp00031: Dyck paths to 312-avoiding permutationPermutations
St000110: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => 4 = 3 + 1
Description
The number of permutations less than or equal to a permutation in left weak order. This is the same as the number of permutations less than or equal to the given permutation in right weak order.
Mp00031: Dyck paths to 312-avoiding permutationPermutations
St001464: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => 4 = 3 + 1
Description
The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise.
Mp00101: Dyck paths decomposition reverseDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St000548: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> []
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> []
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> 5
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 4
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> 2
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> 2
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [4]
=> 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [4,1]
=> 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [4,2]
=> 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [4,1,1]
=> 5
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [3,3]
=> 2
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,3,1]
=> 5
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,2,2]
=> 3
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1]
=> 4
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5]
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [5,1]
=> 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [5,2]
=> 3
Description
The number of different non-empty partial sums of an integer partition.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00232: Dyck paths parallelogram posetPosets
St000071: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,3),(0,4),(1,7),(2,6),(3,8),(4,8),(5,1),(5,6),(6,7),(8,2),(8,5)],9)
=> 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,8),(2,6),(3,6),(4,7),(5,1),(5,7),(7,8),(8,2),(8,3)],9)
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
=> 5 = 4 + 1
[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]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 1 = 0 + 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]
=> ([(0,5),(1,7),(2,7),(3,4),(4,6),(5,3),(6,1),(6,2)],8)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
=> 2 = 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]
=> ([(0,5),(1,8),(2,7),(3,6),(4,1),(4,7),(5,3),(6,2),(6,4),(7,8)],9)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,8),(2,8),(3,7),(4,7),(5,6),(6,1),(6,2),(8,3),(8,4)],9)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9)
=> 3 = 2 + 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]
=> ([(0,5),(1,7),(2,8),(3,4),(3,7),(4,2),(4,9),(5,6),(6,1),(6,3),(7,9),(9,8)],10)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,6),(1,8),(2,8),(3,7),(4,7),(5,3),(5,4),(6,1),(6,2),(8,5)],9)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,6),(1,9),(2,9),(3,8),(4,7),(5,3),(5,7),(6,1),(6,2),(7,8),(9,4),(9,5)],10)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,6),(1,9),(2,7),(3,7),(4,8),(5,1),(5,8),(6,4),(6,5),(8,9),(9,2),(9,3)],10)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,6),(2,9),(3,7),(4,2),(4,8),(5,4),(5,7),(6,3),(6,5),(7,8),(8,9),(9,1)],10)
=> 4 = 3 + 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]
=> ([(0,6),(1,7),(2,8),(3,4),(3,7),(4,5),(4,10),(5,2),(5,9),(6,1),(6,3),(7,10),(9,8),(10,9)],11)
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,7),(3,7),(4,5),(5,1),(6,4),(7,6)],8)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,7),(2,7),(3,8),(4,8),(5,6),(6,1),(6,2),(8,5)],9)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(2,8),(3,8),(4,7),(5,7),(6,2),(6,3),(7,6),(8,1)],9)
=> 4 = 3 + 1
Description
The number of maximal chains in a poset.
Matching statistic: St000468
Mp00119: Dyck paths to 321-avoiding permutation (Krattenthaler)Permutations
Mp00160: Permutations graph of inversionsGraphs
St000468: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 1 = 0 + 1
[1,0,1,0]
=> [1,2] => ([],2)
=> 1 = 0 + 1
[1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => ([],6)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => ([(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => ([(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => ([(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => ([(2,5),(3,4)],6)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => ([(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => ([(4,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => ([(2,5),(3,4)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => ([(2,5),(3,4)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => ([(1,2),(3,5),(4,5)],6)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => ([(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => ([(1,2),(3,5),(4,5)],6)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => ([(2,5),(3,5),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => ([(4,5)],6)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => ([(2,5),(3,4)],6)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => ([(2,5),(3,4)],6)
=> 4 = 3 + 1
Description
The Hosoya index of a graph. This is the total number of matchings in the graph.
Mp00119: Dyck paths to 321-avoiding permutation (Krattenthaler)Permutations
Mp00236: Permutations Clarke-Steingrimsson-Zeng inversePermutations
St000883: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,2] => [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [2,1] => [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,3,2,1] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,6,5] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,5,4,6] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,6,5,4] => 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,4,3,5,6] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [1,2,4,3,6,5] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,5,4,3,6] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,6,5,4,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [1,3,2,4,5,6] => 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => [1,3,2,5,4,6] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => [1,3,2,6,5,4] => 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,4,3,2,5,6] => 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => [1,4,3,2,6,5] => 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,5,4,3,2,6] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,6,5,4,3,2] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,1,3,4,6,5] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => 4 = 3 + 1
Description
The number of longest increasing subsequences of a permutation.
Mp00327: Dyck paths inverse Kreweras complementDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001814: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> []
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,0]
=> []
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,1,1]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,1,1,1]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,2,2]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,2]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [3,3]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [4]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [2,1,1,1,1]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1,1]
=> 4 = 3 + 1
Description
The number of partitions interlacing the given partition.
Matching statistic: St001300
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00001: Alternating sign matrices to semistandard tableau via monotone trianglesSemistandard tableaux
Mp00214: Semistandard tableaux subcrystalPosets
St001300: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [[1]]
=> ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [[1,1],[2]]
=> ([],1)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [[1,2],[2]]
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [[1,1,2],[2,3],[3]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,1],[2,2,2],[3,3],[4]]
=> ([],1)
=> 0
[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,1,1,1],[2,2,2],[3,4],[4]]
=> ([(0,1)],2)
=> 1
[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,1,1,1],[2,2,3],[3,3],[4]]
=> ([(0,1)],2)
=> 1
[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,1,1,1],[2,2,3],[3,4],[4]]
=> ([(0,2),(2,1)],3)
=> 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]]
=> [[1,1,1,2],[2,2,2],[3,3],[4]]
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [[1,1,1,2],[2,2,2],[3,4],[4]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[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,1,1,2],[2,2,3],[3,3],[4]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,2],[2,2,3],[3,4],[4]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[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,1,1,1,1],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ([],1)
=> 0
[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,1,1,1,1],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1)],2)
=> 1
[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,1,1,1,1],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1)],2)
=> 1
[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,1,1,1,1],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,1,1],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 1
[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,1,1,1,1],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[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,1,1,1,1],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,1,1],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 1
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 5
[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,1,1,1,2],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,1,2],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 5
[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,1,1,1,2],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[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,1,1,1,2],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([],1)
=> 0
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 5
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 5
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
Description
The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset.
Matching statistic: St000189
Mp00035: Dyck paths to alternating sign matrixAlternating sign matrices
Mp00001: Alternating sign matrices to semistandard tableau via monotone trianglesSemistandard tableaux
Mp00214: Semistandard tableaux subcrystalPosets
St000189: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [[1]]
=> ([],1)
=> 1 = 0 + 1
[1,0,1,0]
=> [[1,0],[0,1]]
=> [[1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> [[1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [[1,1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [[1,1,2],[2,3],[3]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[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,1,1,1],[2,2,2],[3,3],[4]]
=> ([],1)
=> 1 = 0 + 1
[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,1,1,1],[2,2,2],[3,4],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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,1,1,1],[2,2,3],[3,3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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,1,1,1],[2,2,3],[3,4],[4]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [[1,1,1,2],[2,2,2],[3,3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [[1,1,1,2],[2,2,2],[3,4],[4]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[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,1,1,2],[2,2,3],[3,3],[4]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[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,1,1,2],[2,2,3],[3,4],[4]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[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,1,1,1,1],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ([],1)
=> 1 = 0 + 1
[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,1,1,1,1],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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,1,1,1,1],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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,1,1,1,1],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[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,1,1,1,1],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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,1,1,1,1],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[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,1,1,1,1],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[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,1,1,1,1],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 6 = 5 + 1
[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,1,1,1,2],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[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,1,1,1,2],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 6 = 5 + 1
[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,1,1,1,2],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[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,1,1,1,2],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([],1)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
Description
The number of elements in the poset.
The following 276 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000363The number of minimal vertex covers of a graph. St000909The number of maximal chains of maximal size in a poset. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001717The largest size of an interval in a poset. St001813The product of the sizes of the principal order filters in a poset. St000082The number of elements smaller than a binary tree in Tamari order. St001346The number of parking functions that give the same permutation. St000100The number of linear extensions of a poset. St000708The product of the parts of an integer partition. St001959The product of the heights of the peaks of a Dyck path. St000910The number of maximal chains of minimal length in a poset. St000656The number of cuts of a poset. St001377The major index minus the number of inversions of a permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000255The number of reduced Kogan faces with the permutation as type. St001684The reduced word complexity of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001220The width of a permutation. St001330The hat guessing number of a graph. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001118The acyclic chromatic index of a graph. St001209The pmaj statistic of a parking function. St001811The Castelnuovo-Mumford regularity of a permutation. St000653The last descent of a permutation. St001497The position of the largest weak excedence of a permutation. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. 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)$. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000454The largest eigenvalue of a graph if it is integral. St000871The number of very big ascents of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000031The number of cycles in the cycle decomposition of a permutation. St000035The number of left outer peaks of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000742The number of big ascents of a permutation after prepending zero. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St001060The distinguishing index of a graph. St000022The number of fixed points of a permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000264The girth of a graph, which is not a tree. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St001115The number of even descents of a permutation. St001875The number of simple modules with projective dimension at most 1. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000451The length of the longest pattern of the form k 1 2. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000356The number of occurrences of the pattern 13-2. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000647The number of big descents of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001394The genus of a permutation. St000389The number of runs of ones of odd length in a binary word. St000651The maximal size of a rise in a permutation. St000662The staircase size of the code of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000307The number of rowmotion orbits of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000039The number of crossings of a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000173The segment statistic of a semistandard tableau. St000317The cycle descent number of a permutation. St000360The number of occurrences of the pattern 32-1. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000491The number of inversions of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St001403The number of vertical separators in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001727The number of invisible inversions of a permutation. St001843The Z-index of a set partition. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000055The inversion sum of a permutation. St000091The descent variation of a composition. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000174The flush statistic of a semistandard tableau. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000216The absolute length of a permutation. St000224The sorting index of a permutation. St000234The number of global ascents of a permutation. St000238The number of indices that are not small weak excedances. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000353The number of inner valleys of a permutation. St000354The number of recoils of a permutation. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000472The sum of the ascent bottoms of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000494The number of inversions of distance at most 3 of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000497The lcb statistic of a set partition. St000538The number of even inversions of a permutation. St000539The number of odd inversions of a permutation. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000565The major index of a set partition. St000598The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, 3 is maximal, (2,3) are consecutive in a block. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000682The Grundy value of Welter's game on a binary word. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000795The mad of a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000836The number of descents of distance 2 of a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000872The number of very big descents of a permutation. St000957The number of Bruhat lower covers of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001114The number of odd descents of a permutation. St001153The number of blocks with even minimum in a set partition. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001309The number of four-cliques in a graph. St001323The independence gap of a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001388The number of non-attacking neighbors of a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001552The number of inversions between excedances and fixed points of a permutation. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001665The number of pure excedances of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001712The number of natural descents of a standard Young tableau. St001726The number of visible inversions of a permutation. St001728The number of invisible descents of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001781The interlacing number of a set partition. St001801Half the number of preimage-image pairs of different parity in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001822The number of alignments of a signed permutation. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001841The number of inversions of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001866The nesting alignments of a signed permutation. St001871The number of triconnected components of a graph. St001874Lusztig's a-function for the symmetric group. St001903The number of fixed points of a parking function. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001928The number of non-overlapping descents in a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000056The decomposition (or block) number of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000209Maximum difference of elements in cycles. St000239The number of small weak excedances. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000274The number of perfect matchings of a graph. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000335The difference of lower and upper interactions. St000470The number of runs in a permutation. St000502The number of successions of a set partitions. St000503The maximal difference between two elements in a common block. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000619The number of cyclic descents of a permutation. St000652The maximal difference between successive positions of a permutation. St000730The maximal arc length of a set partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000864The number of circled entries of the shifted recording tableau of a permutation. St000886The number of permutations with the same antidiagonal sums. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000956The maximal displacement of a permutation. St000991The number of right-to-left minima of a permutation. St001151The number of blocks with odd minimum. St001152The number of pairs with even minimum in a perfect matching. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001246The maximal difference between two consecutive entries of a permutation. St001270The bandwidth of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001557The number of inversions of the second entry of a permutation. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001644The dimension of a graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001792The arboricity of a graph. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St000172The Grundy number of a graph. St000485The length of the longest cycle of a permutation. St000542The number of left-to-right-minima of a permutation. St000675The number of centered multitunnels of a Dyck path. St000808The number of up steps of the associated bargraph. St000824The sum of the number of descents and the number of recoils of a permutation. St001116The game chromatic number of a graph. 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$. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001963The tree-depth of a graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000735The last entry on the main diagonal of a standard tableau. St000259The diameter of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000260The radius of a connected graph. St001645The pebbling number of a connected graph. St000456The monochromatic index of a connected graph. St001498The normalised height of a Nakayama algebra with magnitude 1. 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. St000893The number of distinct diagonal sums of an alternating sign matrix.