searching the database
Your data matches 233 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000259
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000259: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000259: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => ([],1)
=> 0
[2]
=> [1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1
[2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 3
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 4
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,6,3,5] => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 5
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [2,4,6,1,3,5] => ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> 3
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [2,4,1,5,6,3] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,4,1,6,3,7,5] => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 6
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [2,4,5,1,6,3] => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 4
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [2,4,1,6,7,3,5] => ([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> 5
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,4,5,6,1,3] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 3
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [2,4,6,1,7,3,5] => ([(0,6),(1,2),(1,4),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> 4
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,4,6,7,1,3,5] => ([(0,6),(1,4),(1,5),(2,3),(2,6),(3,4),(3,5),(4,6),(5,6)],7)
=> 3
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [2,3,4,6,1,5] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [2,4,1,5,6,7,3] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> 4
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [2,4,5,6,1,7,3] => ([(0,6),(1,5),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> 4
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,4,5,6,7,1,3] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> 3
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,3,4,6,1,7,5] => ([(0,6),(1,6),(2,6),(3,4),(4,5),(5,6)],7)
=> 4
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [2,3,4,6,7,1,5] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> 3
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 2
Description
The diameter of a connected graph.
This is the greatest distance between any pair of vertices.
Matching statistic: St001183
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001183: Dyck paths ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 86%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001183: Dyck paths ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 86%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[2]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 6 + 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 5 + 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 4 + 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 3 + 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0,1,0]
=> ? = 4 + 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 4 + 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 3 + 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 4 + 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 3 + 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 2 + 1
Description
The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001258
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001258: Dyck paths ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 86%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001258: Dyck paths ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 86%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[2]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 6 + 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 5 + 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 4 + 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 3 + 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0,1,0]
=> ? = 4 + 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 4 + 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 3 + 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 4 + 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 3 + 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 2 + 1
Description
Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra.
For at most 6 simple modules this statistic coincides with the injective dimension of the regular module as a bimodule.
Matching statistic: St000831
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000831: Permutations ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 71%
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000831: Permutations ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => ? = 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,1,3] => 3
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => 4
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => 3
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,4,1,6,3,5] => 5
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,5,1,6,3,4] => 3
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,1,5,6,3] => 4
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [2,4,1,6,3,7,5] => ? = 6
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 2
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,5,1,3,6,4] => 4
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [2,4,1,7,3,5,6] => ? = 5
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,5,6,1,3,4] => 3
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [2,5,1,7,3,4,6] => ? = 4
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [2,5,7,1,3,4,6] => ? = 3
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,3,4,6,1,5] => 3
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [2,4,1,5,6,7,3] => ? = 4
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 2
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [2,5,6,1,3,7,4] => ? = 4
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,1,0,0,0,0]
=> [2,5,6,7,1,3,4] => ? = 3
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [2,3,4,6,1,7,5] => ? = 4
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> [2,3,4,7,1,5,6] => ? = 3
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,7,1] => ? = 2
Description
The number of indices that are either descents or recoils.
This is, for a permutation $\pi$ of length $n$, this statistics counts the set
$$\{ 1 \leq i < n : \pi(i) > \pi(i+1) \text{ or } \pi^{-1}(i) > \pi^{-1}(i+1)\}.$$
Matching statistic: St000836
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
St000836: Permutations ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 71%
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
St000836: Permutations ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [1] => [1] => ? = 0 - 1
[2]
=> [1,0,1,0]
=> [2,1] => [2,1] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => [3,1,2] => 1 = 2 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [3,4,1,2] => 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4,1,2,3] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [5,3,4,1,2] => 3 = 4 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [3,5,1,2,4] => 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,6,3,5] => [5,6,3,4,1,2] => 4 = 5 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [2,4,6,1,3,5] => [3,5,6,1,2,4] => 2 = 3 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [2,4,1,5,6,3] => [6,3,4,1,2,5] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,4,1,6,3,7,5] => [7,5,6,3,4,1,2] => ? = 6 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => 1 = 2 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [2,4,5,1,6,3] => [6,3,5,1,2,4] => 3 = 4 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [2,4,1,6,7,3,5] => [5,7,3,4,1,2,6] => ? = 5 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,4,5,6,1,3] => [3,6,1,2,4,5] => 2 = 3 - 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [2,4,6,1,7,3,5] => [5,7,3,6,1,2,4] => ? = 4 - 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,4,6,7,1,3,5] => [3,5,7,1,2,4,6] => ? = 3 - 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [2,3,4,6,1,5] => [5,6,1,2,3,4] => 2 = 3 - 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [2,4,1,5,6,7,3] => [7,3,4,1,2,5,6] => ? = 4 - 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [6,1,2,3,4,5] => 1 = 2 - 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [2,4,5,6,1,7,3] => [7,3,6,1,2,4,5] => ? = 4 - 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,4,5,6,7,1,3] => [3,7,1,2,4,5,6] => ? = 3 - 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,3,4,6,1,7,5] => [7,5,6,1,2,3,4] => ? = 4 - 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [2,3,4,6,7,1,5] => [5,7,1,2,3,4,6] => ? = 3 - 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => [7,1,2,3,4,5,6] => ? = 2 - 1
Description
The number of descents of distance 2 of a permutation.
This is, $\operatorname{des}_2(\pi) = | \{ i : \pi(i) > \pi(i+2) \} |$.
Matching statistic: St000907
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000907: Posets ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000907: Posets ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> ([],1)
=> 1 = 0 + 1
[2]
=> [1,0,1,0]
=> ([(0,1)],2)
=> 2 = 1 + 1
[2,1]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 4 = 3 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6 = 5 + 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> ? = 3 + 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 5 = 4 + 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7 = 6 + 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ? = 2 + 1
[5,3]
=> [1,0,1,0,1,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)
=> ? = 4 + 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
=> ? = 5 + 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> ? = 3 + 1
[6,3]
=> [1,0,1,0,1,0,1,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)
=> ? = 4 + 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,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 + 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
=> ? = 3 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,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)
=> ? = 4 + 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> ([(0,5),(1,8),(2,7),(3,2),(3,6),(4,1),(4,6),(5,3),(5,4),(6,7),(6,8),(7,9),(8,9)],10)
=> ? = 2 + 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,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 + 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ([(0,5),(1,9),(2,8),(3,2),(3,7),(4,1),(4,7),(5,6),(6,3),(6,4),(7,8),(7,9),(8,10),(9,10)],11)
=> ? = 3 + 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> ([(0,6),(1,7),(2,8),(3,9),(4,3),(4,7),(5,2),(5,10),(6,1),(6,4),(7,5),(7,9),(9,10),(10,8)],11)
=> ? = 4 + 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> ([(0,6),(1,11),(2,8),(3,9),(4,5),(4,11),(5,3),(5,7),(6,1),(6,4),(7,8),(7,9),(8,10),(9,10),(11,2),(11,7)],12)
=> ? = 3 + 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ([(0,6),(1,9),(2,8),(3,5),(3,7),(4,1),(4,7),(5,2),(5,10),(6,3),(6,4),(7,9),(7,10),(8,12),(9,11),(10,8),(10,11),(11,12)],13)
=> ? = 2 + 1
Description
The number of maximal antichains of minimal length in a poset.
Matching statistic: St000893
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000893: Alternating sign matrices ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 57%
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000893: Alternating sign matrices ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 57%
Values
[1]
=> [1,0]
=> [1,0]
=> [[1]]
=> ? = 0 + 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [[0,1],[1,0]]
=> 2 = 1 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 3 = 2 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> 4 = 3 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [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]]
=> 5 = 4 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [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]]
=> 4 = 3 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,1,0,0],[0,1,0,0,0,0],[0,0,1,-1,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> ? = 5 + 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,0,1,0],[0,1,0,0,0,0],[0,0,1,0,-1,1],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> ? = 3 + 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,1,0,0],[0,1,0,0,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 5 = 4 + 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,1,0,0,0],[0,1,0,0,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> ? = 6 + 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [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]]
=> 3 = 2 + 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,0,1,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 5 = 4 + 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,1,0,0,0],[0,1,0,0,0,0,0],[0,0,1,-1,0,0,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? = 5 + 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,0,1,0],[0,1,0,0,-1,1],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> ? = 3 + 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,0,1,0,0],[0,1,0,0,0,0,0],[0,0,1,0,-1,0,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? = 4 + 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,0,1,0,0],[0,1,0,0,-1,0,1],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? = 3 + 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,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,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> ? = 3 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,1,0,0,0],[0,1,0,0,0,0,0],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> ? = 4 + 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,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,-1,1],[0,0,0,0,1,0]]
=> 3 = 2 + 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,0,1,0,0],[0,1,0,0,-1,1,0],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> ? = 4 + 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,1,0,0,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,0,0,1,0,0],[0,1,0,0,-1,1,0],[0,0,1,0,0,-1,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? = 3 + 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> ? = 4 + 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,0,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? = 3 + 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> ? = 2 + 1
Description
The number of distinct diagonal sums of an alternating sign matrix.
For example, the sums of the diagonals of the matrix $$\left(\begin{array}{rrrr}
0 & 1 & 0 & 0\\
1 & -1 & 1 & 0\\
0 & 1 & 0 & 0 \\
0 & 0 & 0 & 1
\end{array}\right)$$
are $(0,0,2,0,2,0,0)$, so the statistic is $2$.
Matching statistic: St000725
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000725: Permutations ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 86%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000725: Permutations ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 86%
Values
[1]
=> [[1]]
=> [1] => [1] => 1 = 0 + 1
[2]
=> [[1,2]]
=> [1,2] => [2,1] => 2 = 1 + 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => [2,3,1] => 3 = 2 + 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => [3,4,2,1] => 4 = 3 + 1
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => [3,2,5,4,1] => 3 = 2 + 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => [3,4,5,2,1] => 5 = 4 + 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => [4,3,6,5,2,1] => 4 = 3 + 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => [4,5,6,3,2,1] => 6 = 5 + 1
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [3,4,1,2,5,6,7] => [5,4,7,6,3,2,1] => ? = 3 + 1
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [4,2,5,1,3,6,7] => [4,6,3,7,5,2,1] => ? = 4 + 1
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [4,3,2,1,5,6,7] => [4,5,6,7,3,2,1] => ? = 6 + 1
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [5,6,3,4,1,2,7] => [3,2,5,4,7,6,1] => ? = 2 + 1
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [4,5,6,1,2,3,7,8] => [5,4,3,8,7,6,2,1] => ? = 4 + 1
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [4,2,5,1,3,6,7,8] => [5,7,4,8,6,3,2,1] => ? = 5 + 1
[4,2,2]
=> [[1,2,7,8],[3,4],[5,6]]
=> [5,6,3,4,1,2,7,8] => [4,3,6,5,8,7,2,1] => 4 = 3 + 1
[6,3]
=> [[1,2,3,7,8,9],[4,5,6]]
=> [4,5,6,1,2,3,7,8,9] => [6,5,4,9,8,7,3,2,1] => ? = 4 + 1
[5,2,2]
=> [[1,2,7,8,9],[3,4],[5,6]]
=> [5,6,3,4,1,2,7,8,9] => [5,4,7,6,9,8,3,2,1] => ? = 3 + 1
[4,3,2]
=> [[1,2,5,9],[3,4,8],[6,7]]
=> [6,7,3,4,8,1,2,5,9] => [4,3,7,6,2,9,8,5,1] => ? = 3 + 1
[4,2,2,1]
=> [[1,3,8,9],[2,5],[4,7],[6]]
=> [6,4,7,2,5,1,3,8,9] => [4,6,3,8,5,9,7,2,1] => ? = 4 + 1
[4,3,3]
=> [[1,2,3,10],[4,5,6],[7,8,9]]
=> [7,8,9,4,5,6,1,2,3,10] => [4,3,2,7,6,5,10,9,8,1] => ? = 2 + 1
[4,2,2,2]
=> [[1,2,9,10],[3,4],[5,6],[7,8]]
=> [7,8,5,6,3,4,1,2,9,10] => [4,3,6,5,8,7,10,9,2,1] => ? = 4 + 1
[5,3,3]
=> [[1,2,3,10,11],[4,5,6],[7,8,9]]
=> [7,8,9,4,5,6,1,2,3,10,11] => [5,4,3,8,7,6,11,10,9,2,1] => ? = 3 + 1
[4,3,2,2]
=> [[1,2,7,11],[3,4,10],[5,6],[8,9]]
=> [8,9,5,6,3,4,10,1,2,7,11] => [4,3,7,6,9,8,2,11,10,5,1] => ? = 4 + 1
[5,4,3]
=> [[1,2,3,7,12],[4,5,6,11],[8,9,10]]
=> [8,9,10,4,5,6,11,1,2,3,7,12] => [5,4,3,9,8,7,2,12,11,10,6,1] => ? = 3 + 1
[4,3,3,3]
=> [[1,2,3,13],[4,5,6],[7,8,9],[10,11,12]]
=> ? => ? => ? = 2 + 1
Description
The smallest label of a leaf of the increasing binary tree associated to a permutation.
Matching statistic: St000894
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00006: Alternating sign matrices —gyration⟶ Alternating sign matrices
St000894: Alternating sign matrices ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 71%
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00006: Alternating sign matrices —gyration⟶ Alternating sign matrices
St000894: Alternating sign matrices ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [[1]]
=> [[1]]
=> ? = 0 - 1
[2]
=> [1,0,1,0]
=> [[1,0],[0,1]]
=> [[0,1],[1,0]]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> 1 = 2 - 1
[3,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]]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 2 = 3 - 1
[3,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]]
=> [[0,0,1,0],[0,1,0,0],[1,-1,0,1],[0,1,0,0]]
=> 1 = 2 - 1
[3,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]]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 3 = 4 - 1
[4,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]]
=> [[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> 2 = 3 - 1
[4,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]]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> 4 = 5 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,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,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,-1,1,0],[0,1,-1,1,0,0],[0,0,1,-1,0,1],[0,0,0,1,0,0]]
=> ? = 3 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,1,0,0,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,0,0,0],[0,1,-1,0,1,0],[0,0,1,0,0,0],[0,0,0,0,0,1]]
=> 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0],[0,0,0,0,0,0,1]]
=> ? = 6 - 1
[3,2,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]]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,-1,0,1,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> 1 = 2 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,1,0,-1,1],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,-1,0,1],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0]]
=> ? = 4 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,-1,1,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1]]
=> ? = 5 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,0,0,0],[0,1,-1,0,1,0],[0,0,1,-1,0,1],[0,0,0,1,0,0]]
=> ? = 3 - 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,-1,1,0,0],[0,1,-1,1,-1,0,1],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> ? = 4 - 1
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,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],[0,0,0,0,0,0,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,-1,1,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,-1,0,1],[0,0,0,0,1,0,0]]
=> ? = 3 - 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,1,0,0],[0,1,0,-1,0,1],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,0,1,0],[1,-1,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,0,1],[0,0,0,1,0,0]]
=> ? = 3 - 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,0,1,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1]]
=> ? = 4 - 1
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,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,1,0]]
=> [[0,0,1,0,0,0],[0,1,-1,0,1,0],[1,-1,1,0,-1,1],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0]]
=> ? = 2 - 1
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,1,0,0,-1,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,0,1,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,-1,0,1],[0,0,0,0,1,0,0]]
=> ? = 4 - 1
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,0,0,1],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,1,0,0,0],[1,-1,1,-1,0,1,0],[0,1,-1,1,0,-1,1],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> ? = 3 - 1
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,1,0,-1,0,1,0],[0,0,1,0,0,-1,1],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,0,1,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,-1,0,1],[0,0,0,0,1,0,0]]
=> ? = 4 - 1
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,1,0,-1,0,0,1],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,0,0,1,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,-1,1],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> ? = 3 - 1
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,0,0,0,0,0,1],[0,1,0,0,0,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,0,0,0,1,0]]
=> [[0,0,1,0,0,0,0],[0,1,-1,0,1,0,0],[1,-1,1,0,-1,1,0],[0,1,-1,1,0,-1,1],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> ? = 2 - 1
Description
The trace of an alternating sign matrix.
Matching statistic: St001004
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 86%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 36% ●values known / values provided: 36%●distinct values known / distinct values provided: 86%
Values
[1]
=> [1,0]
=> [1,0]
=> [2,1] => 2 = 0 + 2
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,3,1] => 3 = 1 + 2
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 4 = 2 + 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 5 = 3 + 2
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 4 = 2 + 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => 6 = 4 + 2
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => 5 = 3 + 2
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [2,3,4,7,1,5,6] => 7 = 5 + 2
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [2,3,4,7,6,1,5] => ? = 3 + 2
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [2,3,7,5,1,4,6] => ? = 4 + 2
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [2,3,4,8,1,5,6,7] => ? = 6 + 2
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => 4 = 2 + 2
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [2,3,7,6,1,4,5] => ? = 4 + 2
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [2,3,4,8,6,1,5,7] => ? = 5 + 2
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [2,3,7,5,6,1,4] => ? = 3 + 2
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> [2,3,4,8,7,1,5,6] => ? = 4 + 2
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [2,3,4,8,6,7,1,5] => ? = 3 + 2
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [2,7,5,1,6,3,4] => ? = 3 + 2
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0]
=> [2,3,8,5,6,1,4,7] => ? = 4 + 2
[4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2,7,4,5,6,1,3] => ? = 2 + 2
[4,2,2,2]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> [2,3,8,7,6,1,4,5] => ? = 4 + 2
[5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> [2,3,8,5,6,7,1,4] => ? = 3 + 2
[4,3,2,2]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [2,7,8,1,6,3,4,5] => ? = 4 + 2
[5,4,3]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [2,8,5,1,6,7,3,4] => ? = 3 + 2
[4,3,3,3]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> [2,8,4,5,6,7,1,3] => ? = 2 + 2
Description
The number of indices that are either left-to-right maxima or right-to-left minima.
The (bivariate) generating function for this statistic is (essentially) given in [1], the mid points of a $321$ pattern in the permutation are those elements which are neither left-to-right maxima nor a right-to-left minima, see [[St000371]] and [[St000372]].
The following 223 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St000060The greater neighbor of the maximum. St000144The pyramid weight of the Dyck path. St000216The absolute length of a permutation. St000240The number of indices that are not small excedances. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000495The number of inversions of distance at most 2 of a permutation. St000653The last descent of a permutation. St000911The number of maximal antichains of maximal size in a poset. St001077The prefix exchange distance of a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001497The position of the largest weak excedence of a permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001828The Euler characteristic of a graph. St000485The length of the longest cycle of a permutation. St000673The number of non-fixed points of a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000619The number of cyclic descents of a permutation. St001948The number of augmented double ascents of a permutation. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001557The number of inversions of the second entry of a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. 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$. St001488The number of corners of a skew partition. St000717The number of ordinal summands of a poset. St001570The minimal number of edges to add to make a graph Hamiltonian. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation 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. St001424The number of distinct squares in a binary word. 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. St000390The number of runs of ones in a binary word. St000522The number of 1-protected nodes of a rooted tree. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001621The number of atoms of a lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000521The number of distinct subtrees of an ordered tree. St001267The length of the Lyndon factorization of the binary word. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000173The segment statistic of a semistandard tableau. St000327The number of cover relations in a poset. St000454The largest eigenvalue of a graph if it is integral. St000693The modular (standard) major index of a standard tableau. 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)$. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001485The modular major index of a binary word. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000135The number of lucky cars of the parking function. St000682The Grundy value of Welter's game on a binary word. St000744The length of the path to the largest entry in a standard Young tableau. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St000044The number of vertices of the unicellular map given by a perfect matching. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001686The order of promotion on a Gelfand-Tsetlin pattern. St000075The orbit size of a standard tableau under promotion. St000091The descent variation of a composition. St000133The "bounce" of a permutation. St000168The number of internal nodes of an ordered tree. St000222The number of alignments in the permutation. St000245The number of ascents of a permutation. St000254The nesting number of a set partition. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000356The number of occurrences of the pattern 13-2. St000358The number of occurrences of the pattern 31-2. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000491The number of inversions of a set partition. St000516The number of stretching pairs of a permutation. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000624The normalized sum of the minimal distances to a greater element. St000672The number of minimal elements in Bruhat order not less than the permutation. St000711The number of big exceedences of a permutation. St000779The tier of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000989The number of final rises of a permutation. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001388The number of non-attacking neighbors of a permutation. St001469The holeyness of a permutation. St001535The number of cyclic alignments of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001841The number of inversions of a set partition. St001911A descent variant minus the number of inversions. St001960The number of descents of a permutation minus one if its first entry is not one. St000004The major index of a permutation. St000021The number of descents of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000166The depth minus 1 of an ordered tree. St000211The rank of the set partition. St000213The number of weak exceedances (also weak excedences) of a permutation. St000251The number of nonsingleton blocks of a set partition. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000354The number of recoils of a permutation. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000493The los statistic of a set partition. St000499The rcb statistic of a set partition. St000504The cardinality of the first block of a set partition. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000570The Edelman-Greene number of a permutation. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (2,3) are consecutive in a block. St000654The first descent of a permutation. St000670The reversal length of a permutation. St000702The number of weak deficiencies of a permutation. St000703The number of deficiencies of a permutation. St000794The mak of a permutation. St000798The makl of a permutation. St000809The reduced reflection length of the permutation. St000823The number of unsplittable factors of the set partition. St000829The Ulam distance of a permutation to the identity permutation. St000833The comajor index of a permutation. St000925The number of topologically connected components of a set partition. St000956The maximal displacement of a permutation. St000991The number of right-to-left minima of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001114The number of odd descents of a permutation. 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$. St001220The width of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001313The number of Dyck paths above the lattice path given by a binary word. St001405The number of bonds in a permutation. St001406The number of nonzero entries in a Gelfand Tsetlin pattern. St001409The maximal entry of a semistandard tableau. St001461The number of topologically connected components of the chord diagram of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001517The length of a longest pair of twins in a permutation. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001665The number of pure excedances of a permutation. St001667The maximal size of a pair of weak twins for a permutation. St001729The number of visible descents of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St001769The reflection length of a signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001861The number of Bruhat lower covers of a permutation. St001874Lusztig's a-function for the symmetric group. St001877Number of indecomposable injective modules with projective dimension 2. St001894The depth of a signed permutation. St001927Sparre Andersen's number of positives of a signed permutation. St001928The number of non-overlapping descents in a permutation. St000080The rank of the poset. St000325The width of the tree associated to a permutation. St000470The number of runs in a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000519The largest length of a factor maximising the subword complexity. St000572The dimension exponent of a set partition. St000863The length of the first row of the shifted shape of a permutation. St000922The minimal number such that all substrings of this length are unique. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001083The number of boxed occurrences of 132 in a permutation. St001298The number of repeated entries in the Lehmer code of a permutation. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001516The number of cyclic bonds of a permutation. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001875The number of simple modules with projective dimension at most 1. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000528The height of a poset. St000796The stat' of a permutation. St000906The length of the shortest maximal chain in a poset. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St001375The pancake length of a permutation. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000735The last entry on the main diagonal of a standard tableau. St001782The order of rowmotion on the set of order ideals of a poset.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!