searching the database
Your data matches 557 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: St001232
(load all 22 compositions to match this statistic)
(load all 22 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 4
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Matching statistic: St000395
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000395: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000395: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
Description
The sum of the heights of the peaks of a Dyck path.
Matching statistic: St001034
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001034: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001034: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
Description
The area of the parallelogram polyomino associated with the Dyck path.
The (bivariate) generating function is given in [1].
Matching statistic: St001348
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001348: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001348: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
Description
The bounce of the parallelogram polyomino associated with the Dyck path.
A bijection due to Delest and Viennot [1] associates a Dyck path with a parallelogram polyomino. The bounce statistic is defined in [2].
Matching statistic: St000019
(load all 511 compositions to match this statistic)
(load all 511 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000019: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000019: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 2
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [5,7,1,2,3,4,6] => ? = 7
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [3,5,7,1,2,4,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [3,5,7,1,2,4,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [3,5,7,1,2,4,6] => ? = 6
Description
The cardinality of the support of a permutation.
A permutation $\sigma$ may be written as a product $\sigma = s_{i_1}\dots s_{i_k}$ with $k$ minimal, where $s_i = (i,i+1)$ denotes the simple transposition swapping the entries in positions $i$ and $i+1$.
The set of indices $\{i_1,\dots,i_k\}$ is the '''support''' of $\sigma$ and independent of the chosen way to write $\sigma$ as such a product.
See [2], Definition 1 and Proposition 10.
The '''connectivity set''' of $\sigma$ of length $n$ is the set of indices $1 \leq i < n$ such that $\sigma(k) < i$ for all $k < i$.
Thus, the connectivity set is the complement of the support.
Matching statistic: St001332
(load all 105 compositions to match this statistic)
(load all 105 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001332: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001332: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
Description
The number of steps on the non-negative side of the walk associated with the permutation.
Consider the walk taking an up step for each ascent, and a down step for each descent of the permutation. Then this statistic is the number of steps that begin and end at non-negative height.
Matching statistic: St001958
(load all 865 compositions to match this statistic)
(load all 865 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001958: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001958: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6
Description
The degree of the polynomial interpolating the values of a permutation.
Given a permutation $\pi\in\mathfrak S_n$ there is a polynomial $p$ of minimal degree such that $p(n)=\pi(n)$ for $n\in\{1,\dots,n\}$.
This statistic records the degree of $p$.
Matching statistic: St000740
(load all 95 compositions to match this statistic)
(load all 95 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000740: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000740: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 4 + 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 7 + 1
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [2,1,4,5,3,6,7] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [2,1,4,5,3,6,7] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [2,1,4,5,3,6,7] => ? = 6 + 1
Description
The last entry of a permutation.
This statistic is undefined for the empty permutation.
Matching statistic: St001004
(load all 111 compositions to match this statistic)
(load all 111 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 5 = 4 + 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,0]
=> [3,4,1,5,2,7,6] => ? = 7 + 1
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,7,2,5,6] => ? = 6 + 1
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]].
Matching statistic: St001430
(load all 285 compositions to match this statistic)
(load all 285 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001430: Signed permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001430: Signed permutations ⟶ ℤResult quality: 88% ●values known / values provided: 94%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [2,1] => [2,1] => 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [2,1] => [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,3,4,1] => 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 5 = 4 + 1
[1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => [2,1,4,5,6,7,3] => ? = 7 + 1
[1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,6,7,5] => [2,1,4,3,6,7,5] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,6,7,5] => [2,1,4,3,6,7,5] => ? = 6 + 1
[1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,6,7,5] => [2,1,4,3,6,7,5] => ? = 6 + 1
Description
The number of positive entries in a signed permutation.
The following 547 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001497The position of the largest weak excedence of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St001082The number of boxed occurrences of 123 in a permutation. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000141The maximum drop size of a permutation. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000054The first entry of the permutation. St000018The number of inversions of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St001090The number of pop-stack-sorts needed to sort a permutation. St001245The cyclic maximal difference between two consecutive entries of a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000863The length of the first row of the shifted shape of a permutation. St000625The sum of the minimal distances to a greater element. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St001074The number of inversions of the cyclic embedding of a permutation. St000245The number of ascents of a permutation. St000441The number of successions of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000696The number of cycles in the breakpoint graph of a permutation. St000703The number of deficiencies of a permutation. St000110The number of permutations less than or equal to a permutation in left weak order. St000451The length of the longest pattern of the form k 1 2. St000825The sum of the major and the inverse major index of a permutation. St000022The number of fixed points of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000220The number of occurrences of the pattern 132 in a permutation. St000356The number of occurrences of the pattern 13-2. St000359The number of occurrences of the pattern 23-1. St000463The number of admissible inversions of a permutation. St000648The number of 2-excedences of a permutation. St000662The staircase size of the code of a permutation. St000731The number of double exceedences of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St000007The number of saliances of the permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000153The number of adjacent cycles of a permutation. St000237The number of small exceedances. St000246The number of non-inversions of a permutation. St000651The maximal size of a rise in a permutation. St000883The number of longest increasing subsequences of a permutation. St001622The number of join-irreducible elements of a lattice. St001925The minimal number of zeros in a row of an alternating sign matrix. St000890The number of nonzero entries in an alternating sign matrix. St000147The largest part of an integer partition. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St000384The maximal part of the shifted composition of an integer partition. St000784The maximum of the length and the largest part of the integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000010The length of the partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St000093The cardinality of a maximal independent set of vertices of a graph. St000050The depth or height of a binary tree. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000528The height of a poset. St000912The number of maximal antichains in a poset. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St000259The diameter of a connected graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St000273The domination number of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000916The packing number of a graph. St001286The annihilation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001829The common independence number of a graph. St000778The metric dimension of a graph. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001494The Alon-Tarsi number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St000288The number of ones in a binary word. St000336The leg major index of a standard tableau. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001644The dimension of a graph. St000505The biggest entry in the block containing the 1. St000503The maximal difference between two elements in a common block. St000839The largest opener of a set partition. 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. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001820The size of the image of the pop stack sorting operator. St001720The minimal length of a chain of small intervals in a lattice. St000459The hook length of the base cell of a partition. St000653The last descent of a permutation. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St000144The pyramid weight of the Dyck path. St000189The number of elements in the poset. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000026The position of the first return of a Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St000051The size of the left subtree of a binary tree. St000209Maximum difference of elements in cycles. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000081The number of edges of a graph. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000501The size of the first part in the decomposition of a permutation. St000553The number of blocks of a graph. St000638The number of up-down runs of a permutation. St000733The row containing the largest entry of a standard tableau. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001439The number of even weak deficiencies and of odd weak exceedences. St001479The number of bridges of a graph. St000058The order of a permutation. St000167The number of leaves of an ordered tree. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000052The number of valleys of a Dyck path not on the x-axis. St000067The inversion number of the alternating sign matrix. St000133The "bounce" of a permutation. St000171The degree of the graph. St000210Minimum over maximum difference of elements in cycles. St000224The sorting index of a permutation. St000339The maf index of a permutation. St000362The size of a minimal vertex cover of a graph. St000840The number of closers smaller than the largest opener in a perfect matching. St000868The aid statistic in the sense of Shareshian-Wachs. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001391The disjunction number of a graph. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001726The number of visible inversions of a permutation. St001910The height of the middle non-run of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000240The number of indices that are not small excedances. St000363The number of minimal vertex covers of a graph. St000632The jump number of the poset. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000728The dimension of a set partition. St000794The mak of a permutation. St000924The number of topologically connected components of a perfect matching. St001120The length of a longest path in a graph. St001176The size of a partition minus its first part. St001252Half the sum of the even parts of a partition. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000228The size of a partition. St000312The number of leaves in a graph. St000527The width of the poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001342The number of vertices in the center of a graph. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001746The coalition number of a graph. St000060The greater neighbor of the maximum. St000831The number of indices that are either descents or recoils. St000956The maximal displacement of a permutation. St001480The number of simple summands of the module J^2/J^3. St000225Difference between largest and smallest parts in a partition. St000673The number of non-fixed points of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000844The size of the largest block in the direct sum decomposition 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. St000197The number of entries equal to positive one in the alternating sign matrix. St000216The absolute length of a permutation. St000619The number of cyclic descents of a permutation. St000652The maximal difference between successive positions of a permutation. St000795The mad of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St000809The reduced reflection length of the permutation. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001959The product of the heights of the peaks of a Dyck path. St000064The number of one-box pattern of a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000961The shifted major index of a permutation. St001280The number of parts of an integer partition that are at least two. St001388The number of non-attacking neighbors of a permutation. St001432The order dimension of the partition. St000308The height of the tree associated to a permutation. St000746The number of pairs with odd minimum in a perfect matching. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000426The number of occurrences of the pattern 132 or of the pattern 312 in a permutation. St000462The major index minus the number of excedences of a permutation. St000873The aix statistic of a permutation. St001298The number of repeated entries in the Lehmer code of a permutation. St001377The major index minus the number of inversions of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001911A descent variant minus the number of inversions. St000255The number of reduced Kogan faces with the permutation as type. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000530The number of permutations with the same descent word as the given permutation. St000654The first descent of a permutation. St000702The number of weak deficiencies of a permutation. St000798The makl of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001671Haglund's hag of a permutation. St001379The number of inversions plus the major index of a permutation. St000454The largest eigenvalue of a graph if it is integral. St001330The hat guessing number of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001268The size of the largest ordinal summand in the poset. St001725The harmonious chromatic number of a graph. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000080The rank of the poset. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000741The Colin de Verdière graph invariant. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001962The proper pathwidth of a graph. St000822The Hadwiger number of the graph. St001316The domatic number of a graph. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St001875The number of simple modules with projective dimension at most 1. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St001397Number of pairs of incomparable elements in a finite poset. St000549The number of odd partial sums of an integer partition. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001468The smallest fixpoint of a permutation. St000159The number of distinct parts of the integer partition. St000317The cycle descent number of a permutation. St000331The number of upper interactions of a Dyck path. St000358The number of occurrences of the pattern 31-2. St000732The number of double deficiencies of a permutation. St000989The number of final rises of a permutation. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001684The reduced word complexity of a permutation. St001727The number of invisible inversions of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000015The number of peaks of a Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000134The size of the orbit of an alternating sign matrix under gyration. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000305The inverse major index of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000833The comajor index of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000991The number of right-to-left minima of a permutation. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000235The number of indices that are not cyclical small weak excedances. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000004The major index of a permutation. St000021The number of descents of a permutation. St000039The number of crossings of a permutation. St000095The number of triangles of a graph. St000117The number of centered tunnels of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000221The number of strong fixed points of a permutation. St000222The number of alignments in the permutation. St000242The number of indices that are not cyclical small weak excedances. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000338The number of pixed points of a permutation. St000354The number of recoils of a permutation. St000355The number of occurrences of the pattern 21-3. St000434The number of occurrences of the pattern 213 or of the pattern 312 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. St000446The disorder of a permutation. St000538The number of even inversions of a permutation. St000539The number of odd inversions of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001061The number of indices that are both descents and recoils of a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001152The number of pairs with even minimum in a perfect matching. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001489The maximum of the number of descents and the number of inverse descents. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000056The decomposition (or block) number of a permutation. St000120The number of left tunnels of a Dyck path. St000154The sum of the descent bottoms of a permutation. St000156The Denert index of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000304The load of a permutation. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000332The positive inversions of an alternating sign matrix. St000335The difference of lower and upper interactions. St000443The number of long tunnels of a Dyck path. St000450The number of edges minus the number of vertices plus 2 of a graph. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000547The number of even non-empty partial sums of an integer partition. St000780The size of the orbit under rotation of a perfect matching. St000841The largest opener of a perfect matching. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000988The orbit size of a permutation under Foata's bijection. St000990The first ascent of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. 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. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001274The number of indecomposable injective modules with projective dimension equal to two. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001304The number of maximally independent sets of vertices of a graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001405The number of bonds in a permutation. St001428The number of B-inversions of a signed permutation. St001429The number of negative entries in a signed permutation. St001481The minimal height of a peak of a Dyck path. St001530The depth of a Dyck path. St001555The order of a signed permutation. St001589The nesting number of a perfect matching. St001759The Rajchgot index of a permutation. St001863The number of weak excedances of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001963The tree-depth of a graph. St000231Sum of the maximal elements of the blocks of a set partition. St000236The number of cyclical small weak excedances. St000241The number of cyclical small excedances. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000471The sum of the ascent tops of a permutation. St000616The inversion index of a permutation. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001040The depth of the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001180Number of indecomposable injective modules with projective dimension at most 1. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001346The number of parking functions that give the same permutation. St001566The length of the longest arithmetic progression in a permutation. St000456The monochromatic index of a connected graph. St000520The number of patterns in a permutation. St000756The sum of the positions of the left to right maxima of a permutation. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001259The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001706The number of closed sets in a graph. St000327The number of cover relations in a poset. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001948The number of augmented double ascents of a permutation. St001557The number of inversions of the second entry of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000474Dyson's crank of a partition. St000896The number of zeros on the main diagonal of an alternating sign matrix. 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$. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. 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$. St001927Sparre Andersen's number of positives of a signed permutation. St001645The pebbling number of a connected graph. St000744The length of the path to the largest entry in a standard Young tableau. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001845The number of join irreducibles minus the rank of a lattice. St000691The number of changes 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. St001812The biclique partition number of a graph. St001434The number of negative sum pairs of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001817The number of flag weak exceedances of a signed permutation. St001892The flag excedance statistic of a signed permutation. St001782The order of rowmotion on the set of order ideals of a poset. St000681The Grundy value of Chomp on Ferrers diagrams. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St000478Another weight of a partition according to Alladi. St000157The number of descents of a standard tableau. St000507The number of ascents of a standard tableau. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St000834The number of right outer peaks of a permutation. St000035The number of left outer peaks of a permutation. St000352The Elizalde-Pak rank of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000742The number of big ascents of a permutation after prepending zero. St000203The number of external nodes of a binary tree. St000884The number of isolated descents of a permutation. St001437The flex of a binary word. St000044The number of vertices of the unicellular map given by a perfect matching. St000017The number of inversions of a standard tableau. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001424The number of distinct squares in a binary word. St001712The number of natural descents of a standard Young tableau. St000135The number of lucky cars of the parking function. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001884The number of borders of a binary word. St000393The number of strictly increasing runs in a binary word. St000820The number of compositions obtained by rotating the composition. St001267The length of the Lyndon factorization of the binary word. St000292The number of ascents of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001742The difference of the maximal and the minimal degree in a graph. St001769The reflection length of a signed permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001821The sorting index of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St001896The number of right descents of a signed permutations. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000693The modular (standard) major index of a standard tableau. St000945The number of matchings in the dihedral orbit of a perfect matching. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001214The aft of an integer partition. St001413Half the length of the longest even length palindromic prefix of a binary word. St001415The length of the longest palindromic prefix of a binary word. 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. St001427The number of descents of a signed permutation. St001485The modular major index of a binary word. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001524The degree of symmetry of a binary word. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001697The shifted natural comajor index of a standard Young tableau. St001770The number of facets of a certain subword complex associated with the signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001777The number of weak descents in an integer composition. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St001486The number of corners of the ribbon associated with an integer composition. 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. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order.
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!