Processing math: 51%

Your data matches 56 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001928: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0 = 1 - 1
[1,2] => 0 = 1 - 1
[2,1] => 1 = 2 - 1
[1,2,3] => 0 = 1 - 1
[1,3,2] => 1 = 2 - 1
[2,1,3] => 1 = 2 - 1
[2,3,1] => 1 = 2 - 1
[3,1,2] => 1 = 2 - 1
[3,2,1] => 1 = 2 - 1
[1,2,3,4] => 0 = 1 - 1
[1,2,4,3] => 1 = 2 - 1
[1,3,2,4] => 1 = 2 - 1
[1,3,4,2] => 1 = 2 - 1
[1,4,2,3] => 1 = 2 - 1
[1,4,3,2] => 1 = 2 - 1
[2,1,3,4] => 1 = 2 - 1
[2,1,4,3] => 2 = 3 - 1
[2,3,1,4] => 1 = 2 - 1
[2,3,4,1] => 1 = 2 - 1
[2,4,1,3] => 1 = 2 - 1
[2,4,3,1] => 1 = 2 - 1
[3,1,2,4] => 1 = 2 - 1
[3,1,4,2] => 2 = 3 - 1
[3,2,1,4] => 1 = 2 - 1
[3,2,4,1] => 2 = 3 - 1
[3,4,1,2] => 1 = 2 - 1
[3,4,2,1] => 1 = 2 - 1
[4,1,2,3] => 1 = 2 - 1
[4,1,3,2] => 2 = 3 - 1
[4,2,1,3] => 1 = 2 - 1
[4,2,3,1] => 2 = 3 - 1
[4,3,1,2] => 1 = 2 - 1
[4,3,2,1] => 2 = 3 - 1
[1,2,3,4,5] => 0 = 1 - 1
[1,2,3,5,4] => 1 = 2 - 1
[1,2,4,3,5] => 1 = 2 - 1
[1,2,4,5,3] => 1 = 2 - 1
[1,2,5,3,4] => 1 = 2 - 1
[1,2,5,4,3] => 1 = 2 - 1
[1,3,2,4,5] => 1 = 2 - 1
[1,3,2,5,4] => 2 = 3 - 1
[1,3,4,2,5] => 1 = 2 - 1
[1,3,4,5,2] => 1 = 2 - 1
[1,3,5,2,4] => 1 = 2 - 1
[1,3,5,4,2] => 1 = 2 - 1
[1,4,2,3,5] => 1 = 2 - 1
[1,4,2,5,3] => 2 = 3 - 1
[1,4,3,2,5] => 1 = 2 - 1
[1,4,3,5,2] => 2 = 3 - 1
[1,4,5,2,3] => 1 = 2 - 1
Description
The number of non-overlapping descents in a permutation. In other words, any maximal descending subsequence πi,πi+1,,πk contributes ki+12 to the total count.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001165: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> 1
[2,1] => [1,1] => [1,0,1,0]
=> 2
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 2
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
Description
Number of simple modules with even projective dimension in the corresponding Nakayama algebra.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001471: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> 1
[2,1] => [1,1] => [1,0,1,0]
=> 2
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 2
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
Description
The magnitude of a Dyck path. The magnitude of a finite dimensional algebra with invertible Cartan matrix C is defined as the sum of all entries of the inverse of C. We define the magnitude of a Dyck path as the magnitude of the corresponding LNakayama algebra.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000329: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0 = 1 - 1
[1,2] => [2] => [1,1,0,0]
=> 1 = 2 - 1
[2,1] => [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 2 = 3 - 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
Description
The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001508: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0 = 1 - 1
[1,2] => [2] => [1,1,0,0]
=> 1 = 2 - 1
[2,1] => [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 2 = 3 - 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
Description
The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. Given two lattice paths U,L from (0,0) to (d,nd), [1] describes a bijection between lattice paths weakly between U and L and subsets of {1,,n} such that the set of all such subsets gives the standard complex of the lattice path matroid M[U,L]. This statistic gives the cardinality of the image of this bijection when a Dyck path is considered as a path weakly above the diagonal and relative to the diagonal boundary.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001873: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0 = 1 - 1
[1,2] => [2] => [1,1,0,0]
=> 1 = 2 - 1
[2,1] => [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 2 = 3 - 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
Description
For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between eiJ and ejJ (the radical of the indecomposable projective modules). The statistic gives half of the rank of the matrix C^t-C.
Matching statistic: St000015
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 2
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
Description
The number of peaks of a Dyck path.
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St000676: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,1,0,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> [1,1,1,0,0,0]
=> 2
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 3
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 3
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 3
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 3
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 3
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 3
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 3
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 3
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 3
Description
The number of odd rises of a Dyck path. This is the number of ones at an odd position, with the initial position equal to 1. The number of Dyck paths of semilength n with k up steps in odd positions and k returns to the main diagonal are counted by the binomial coefficient \binom{n-1}{k-1} [3,4].
Matching statistic: St001068
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 2
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St001203
Mp00071: Permutations descent compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,1,0,0]
=> 1
[1,2] => [2] => [1,1,0,0]
=> [1,1,1,0,0,0]
=> 1
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 2
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 2
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2
Description
We associate to 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 Dyck path as follows: In the list L delete the first entry c_0 and substract from all other entries n-1 and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra. Example: [5,6,6,6,6] goes into [2,2,2,2,1]. Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra. The statistic return the global dimension of the CNakayama algebra divided by 2.
The following 46 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000053The number of valleys of the Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules S with grade \inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \} at least two in the Nakayama algebra A corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St000216The absolute length of a permutation. St000539The number of odd inversions of a permutation. St000809The reduced reflection length of the permutation. St000260The radius of a connected graph. St000264The girth of a graph, which is not a tree. St001060The distinguishing index of a graph. St001875The number of simple modules with projective dimension at most 1. St000259The diameter of a connected graph. St000306The bounce count of a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000454The largest eigenvalue of a graph if it is integral. St001394The genus of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001330The hat guessing number of a graph. St001152The number of pairs with even minimum in a perfect matching. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. 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. St001720The minimal length of a chain of small intervals in a lattice. St001896The number of right descents of a signed permutations. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001864The number of excedances of a signed permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001597The Frobenius rank of a skew partition. St000862The number of parts of the shifted shape of a permutation. St001624The breadth of a lattice.