Processing math: 12%

Your data matches 159 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001431: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 0
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 1
Description
Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I. See http://www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
Mp00023: Dyck paths to non-crossing permutationPermutations
St000058: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [3,2,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2 = 1 + 1
Description
The order of a permutation. ord(π) is given by the minimial k for which πk is the identity permutation.
Mp00023: Dyck paths to non-crossing permutationPermutations
St000485: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => 1 = 0 + 1
[1,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,2,3] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,3,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [3,2,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2 = 1 + 1
Description
The length of the longest cycle of a permutation.
Mp00222: Dyck paths peaks-to-valleysDyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
Description
The finitistic dominant dimension of a Dyck path. To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
Mp00101: Dyck paths decomposition reverseDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St000160: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,0]
=> []
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 1
Description
The multiplicity of the smallest part of a partition. This counts the number of occurrences of the smallest part spt(λ) of a partition λ. The sum spt(n)=λnspt(λ) satisfies the congruences \begin{align*} spt(5n+4) &\equiv 0\quad \pmod{5}\\\ spt(7n+5) &\equiv 0\quad \pmod{7}\\\ spt(13n+6) &\equiv 0\quad \pmod{13}, \end{align*} analogous to those of the counting function of partitions, see [1] and [2].
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00108: Permutations cycle typeInteger partitions
St000319: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,1]
=> 0
[1,1,0,0]
=> [2,1] => [2]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [2,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [2,2]
=> 1
Description
The spin of an integer partition. The Ferrers shape of an integer partition \lambda can be decomposed into border strips. The spin is then defined to be the total number of crossings of border strips of \lambda with the vertical lines in the Ferrers shape. The following example is taken from Appendix B in [1]: Let \lambda = (5,5,4,4,2,1). Removing the border strips successively yields the sequence of partitions (5,5,4,4,2,1), (4,3,3,1), (2,2), (1), (). The first strip (5,5,4,4,2,1) \setminus (4,3,3,1) crosses 4 times, the second strip (4,3,3,1) \setminus (2,2) crosses 3 times, the strip (2,2) \setminus (1) crosses 1 time, and the remaining strip (1) \setminus () does not cross. This yields the spin of (5,5,4,4,2,1) to be 4+3+1 = 8.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00108: Permutations cycle typeInteger partitions
St000320: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,1]
=> 0
[1,1,0,0]
=> [2,1] => [2]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [2,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [2,2]
=> 1
Description
The dinv adjustment of an integer partition. The Ferrers shape of an integer partition \lambda = (\lambda_1,\ldots,\lambda_k) can be decomposed into border strips. For 0 \leq j < \lambda_1 let n_j be the length of the border strip starting at (\lambda_1-j,0). The dinv adjustment is then defined by \sum_{j:n_j > 0}(\lambda_1-1-j). The following example is taken from Appendix B in [2]: Let \lambda=(5,5,4,4,2,1). Removing the border strips successively yields the sequence of partitions (5,5,4,4,2,1),(4,3,3,1),(2,2),(1),(), and we obtain (n_0,\ldots,n_4) = (10,7,0,3,1). The dinv adjustment is thus 4+3+1+0 = 8.
Mp00327: Dyck paths inverse Kreweras complementDyck paths
Mp00025: Dyck paths to 132-avoiding permutationPermutations
St000374: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 3
[1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 1
Description
The number of exclusive right-to-left minima of a permutation. This is the number of right-to-left minima that are not left-to-right maxima. This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3. Given a permutation \pi = [\pi_1,\ldots,\pi_n], this statistic counts the number of position j such that \pi_j < j and there do not exist indices i,k with i < j < k and \pi_i > \pi_j > \pi_k. See also [[St000213]] and [[St000119]].
Mp00124: Dyck paths Adin-Bagno-Roichman transformationDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
St001192: 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,1,0,0]
=> 0
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
Description
The maximal dimension of Ext_A^2(S,A) for a simple module S over the corresponding Nakayama algebra A.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St001418: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 1
Description
Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. The stable Auslander algebra is by definition the stable endomorphism ring of the direct sum of all indecomposable modules.
The following 149 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000147The largest part of an integer partition. St000444The length of the maximal rise of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000668The least common multiple of the parts of the partition. St001062The maximal size of a block of a set partition. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001555The order of a signed permutation. St000025The number of initial rises of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000141The maximum drop size of a permutation. St000392The length of the longest run of ones in a binary word. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000662The staircase size of the code of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000956The maximal displacement of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001090The number of pop-stack-sorts needed to sort a permutation. 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). 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. St000010The length of the partition. St000299The number of nonisomorphic vertex-induced subtrees. St000308The height of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000381The largest part of an integer composition. St000542The number of left-to-right-minima of a permutation. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000734The last entry in the first row of a standard tableau. St000808The number of up steps of the associated bargraph. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001058The breadth of the ordered tree. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001346The number of parking functions that give the same permutation. St001372The length of a longest cyclic run of ones of a binary word. St001530The depth of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000439The position of the first down step of a Dyck path. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000455The second largest eigenvalue of a graph if it is integral. St000907The number of maximal antichains of minimal length in a poset. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000806The semiperimeter of the associated bargraph. St000871The number of very big ascents of a permutation. St001394The genus of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000035The number of left outer peaks of a permutation. St000022The number of fixed points of a permutation. St000260The radius of a connected graph. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length 3. St001115The number of even descents of a permutation. St000259The diameter of a connected graph. St000317The cycle descent number of a permutation. St000023The number of inner peaks of a permutation. St000091The descent variation of a composition. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000353The number of inner valleys of a permutation. St000360The number of occurrences of the pattern 32-1. St000460The hook length of the last cell along the main diagonal of an integer partition. St000486The number of cycles of length at least 3 of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000836The number of descents of distance 2 of a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000872The number of very big descents of a permutation. St000937The number of positive values of the symmetric group character corresponding to the partition. St001061The number of indices that are both descents and recoils of a permutation. St001114The number of odd descents of a permutation. St001153The number of blocks with even minimum in a set partition. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001552The number of inversions between excedances and fixed points of a permutation. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001665The number of pure excedances of a permutation. St001712The number of natural descents of a standard Young tableau. St001728The number of invisible descents of a permutation. St001729The number of visible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001871The number of triconnected components of a graph. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001960The number of descents of a permutation minus one if its first entry is not one. St000062The length of the longest increasing subsequence of the permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000354The number of recoils of a permutation. St000478Another weight of a partition according to Alladi. St000502The number of successions of a set partitions. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000934The 2-degree of an integer partition. St001151The number of blocks with odd minimum. St001152The number of pairs with even minimum in a perfect matching. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001489The maximum of the number of descents and the number of inverse descents. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001737The number of descents of type 2 in a permutation. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001905The number of preferred parking spots in a parking function less than the index of the car. St000824The sum of the number of descents and the number of recoils 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. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000735The last entry on the main diagonal of a standard tableau. St000307The number of rowmotion orbits of a poset. St001632The number of indecomposable injective modules I with dim Ext^1(I,A)=1 for the incidence algebra A of a poset. St001644The dimension of a graph. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000264The girth of a graph, which is not a tree. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. 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. St000893The number of distinct diagonal sums of an alternating sign matrix. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000456The monochromatic index of a connected graph. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000100The number of linear extensions of a poset. St000527The width of the poset. St000909The number of maximal chains of maximal size in a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. 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. St000422The energy of a graph, if it is integral. St001645The pebbling number of a connected graph.