searching the database
Your data matches 91 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: St000991
(load all 134 compositions to match this statistic)
(load all 134 compositions to match this statistic)
St000991: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 2
[2,1] => 1
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 1
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 3
[1,3,4,2] => 2
[1,4,2,3] => 3
[1,4,3,2] => 2
[2,1,3,4] => 3
[2,1,4,3] => 2
[2,3,1,4] => 2
[2,3,4,1] => 1
[2,4,1,3] => 2
[2,4,3,1] => 1
[3,1,2,4] => 3
[3,1,4,2] => 2
[3,2,1,4] => 2
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 1
[4,1,2,3] => 3
[4,1,3,2] => 2
[4,2,1,3] => 2
[4,2,3,1] => 1
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 4
[1,2,4,5,3] => 3
[1,2,5,3,4] => 4
[1,2,5,4,3] => 3
[1,3,2,4,5] => 4
[1,3,2,5,4] => 3
[1,3,4,2,5] => 3
[1,3,4,5,2] => 2
[1,3,5,2,4] => 3
[1,3,5,4,2] => 2
[1,4,2,3,5] => 4
[1,4,2,5,3] => 3
[1,4,3,2,5] => 3
[1,4,3,5,2] => 2
[1,4,5,2,3] => 3
Description
The number of right-to-left minima of a permutation.
For the number of left-to-right maxima, see [[St000314]].
Matching statistic: St000007
(load all 105 compositions to match this statistic)
(load all 105 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,2] => [2,1] => 2
[2,1] => [1,2] => 1
[1,2,3] => [3,2,1] => 3
[1,3,2] => [3,1,2] => 2
[2,1,3] => [2,3,1] => 2
[2,3,1] => [2,1,3] => 1
[3,1,2] => [1,3,2] => 2
[3,2,1] => [1,2,3] => 1
[1,2,3,4] => [4,3,2,1] => 4
[1,2,4,3] => [4,3,1,2] => 3
[1,3,2,4] => [4,2,3,1] => 3
[1,3,4,2] => [4,2,1,3] => 2
[1,4,2,3] => [4,1,3,2] => 3
[1,4,3,2] => [4,1,2,3] => 2
[2,1,3,4] => [3,4,2,1] => 3
[2,1,4,3] => [3,4,1,2] => 2
[2,3,1,4] => [3,2,4,1] => 2
[2,3,4,1] => [3,2,1,4] => 1
[2,4,1,3] => [3,1,4,2] => 2
[2,4,3,1] => [3,1,2,4] => 1
[3,1,2,4] => [2,4,3,1] => 3
[3,1,4,2] => [2,4,1,3] => 2
[3,2,1,4] => [2,3,4,1] => 2
[3,2,4,1] => [2,3,1,4] => 1
[3,4,1,2] => [2,1,4,3] => 2
[3,4,2,1] => [2,1,3,4] => 1
[4,1,2,3] => [1,4,3,2] => 3
[4,1,3,2] => [1,4,2,3] => 2
[4,2,1,3] => [1,3,4,2] => 2
[4,2,3,1] => [1,3,2,4] => 1
[4,3,1,2] => [1,2,4,3] => 2
[4,3,2,1] => [1,2,3,4] => 1
[1,2,3,4,5] => [5,4,3,2,1] => 5
[1,2,3,5,4] => [5,4,3,1,2] => 4
[1,2,4,3,5] => [5,4,2,3,1] => 4
[1,2,4,5,3] => [5,4,2,1,3] => 3
[1,2,5,3,4] => [5,4,1,3,2] => 4
[1,2,5,4,3] => [5,4,1,2,3] => 3
[1,3,2,4,5] => [5,3,4,2,1] => 4
[1,3,2,5,4] => [5,3,4,1,2] => 3
[1,3,4,2,5] => [5,3,2,4,1] => 3
[1,3,4,5,2] => [5,3,2,1,4] => 2
[1,3,5,2,4] => [5,3,1,4,2] => 3
[1,3,5,4,2] => [5,3,1,2,4] => 2
[1,4,2,3,5] => [5,2,4,3,1] => 4
[1,4,2,5,3] => [5,2,4,1,3] => 3
[1,4,3,2,5] => [5,2,3,4,1] => 3
[1,4,3,5,2] => [5,2,3,1,4] => 2
[1,4,5,2,3] => [5,2,1,4,3] => 3
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Matching statistic: St000314
(load all 51 compositions to match this statistic)
(load all 51 compositions to match this statistic)
Mp00066: Permutations —inverse⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,2] => [1,2] => 2
[2,1] => [2,1] => 1
[1,2,3] => [1,2,3] => 3
[1,3,2] => [1,3,2] => 2
[2,1,3] => [2,1,3] => 2
[2,3,1] => [3,1,2] => 1
[3,1,2] => [2,3,1] => 2
[3,2,1] => [3,2,1] => 1
[1,2,3,4] => [1,2,3,4] => 4
[1,2,4,3] => [1,2,4,3] => 3
[1,3,2,4] => [1,3,2,4] => 3
[1,3,4,2] => [1,4,2,3] => 2
[1,4,2,3] => [1,3,4,2] => 3
[1,4,3,2] => [1,4,3,2] => 2
[2,1,3,4] => [2,1,3,4] => 3
[2,1,4,3] => [2,1,4,3] => 2
[2,3,1,4] => [3,1,2,4] => 2
[2,3,4,1] => [4,1,2,3] => 1
[2,4,1,3] => [3,1,4,2] => 2
[2,4,3,1] => [4,1,3,2] => 1
[3,1,2,4] => [2,3,1,4] => 3
[3,1,4,2] => [2,4,1,3] => 2
[3,2,1,4] => [3,2,1,4] => 2
[3,2,4,1] => [4,2,1,3] => 1
[3,4,1,2] => [3,4,1,2] => 2
[3,4,2,1] => [4,3,1,2] => 1
[4,1,2,3] => [2,3,4,1] => 3
[4,1,3,2] => [2,4,3,1] => 2
[4,2,1,3] => [3,2,4,1] => 2
[4,2,3,1] => [4,2,3,1] => 1
[4,3,1,2] => [3,4,2,1] => 2
[4,3,2,1] => [4,3,2,1] => 1
[1,2,3,4,5] => [1,2,3,4,5] => 5
[1,2,3,5,4] => [1,2,3,5,4] => 4
[1,2,4,3,5] => [1,2,4,3,5] => 4
[1,2,4,5,3] => [1,2,5,3,4] => 3
[1,2,5,3,4] => [1,2,4,5,3] => 4
[1,2,5,4,3] => [1,2,5,4,3] => 3
[1,3,2,4,5] => [1,3,2,4,5] => 4
[1,3,2,5,4] => [1,3,2,5,4] => 3
[1,3,4,2,5] => [1,4,2,3,5] => 3
[1,3,4,5,2] => [1,5,2,3,4] => 2
[1,3,5,2,4] => [1,4,2,5,3] => 3
[1,3,5,4,2] => [1,5,2,4,3] => 2
[1,4,2,3,5] => [1,3,4,2,5] => 4
[1,4,2,5,3] => [1,3,5,2,4] => 3
[1,4,3,2,5] => [1,4,3,2,5] => 3
[1,4,3,5,2] => [1,5,3,2,4] => 2
[1,4,5,2,3] => [1,4,5,2,3] => 3
Description
The number of left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a '''left-to-right-maximum''' if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
Matching statistic: St000542
(load all 44 compositions to match this statistic)
(load all 44 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
St000542: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000542: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,2] => [2,1] => 2
[2,1] => [1,2] => 1
[1,2,3] => [3,2,1] => 3
[1,3,2] => [2,3,1] => 2
[2,1,3] => [3,1,2] => 2
[2,3,1] => [1,3,2] => 1
[3,1,2] => [2,1,3] => 2
[3,2,1] => [1,2,3] => 1
[1,2,3,4] => [4,3,2,1] => 4
[1,2,4,3] => [3,4,2,1] => 3
[1,3,2,4] => [4,2,3,1] => 3
[1,3,4,2] => [2,4,3,1] => 2
[1,4,2,3] => [3,2,4,1] => 3
[1,4,3,2] => [2,3,4,1] => 2
[2,1,3,4] => [4,3,1,2] => 3
[2,1,4,3] => [3,4,1,2] => 2
[2,3,1,4] => [4,1,3,2] => 2
[2,3,4,1] => [1,4,3,2] => 1
[2,4,1,3] => [3,1,4,2] => 2
[2,4,3,1] => [1,3,4,2] => 1
[3,1,2,4] => [4,2,1,3] => 3
[3,1,4,2] => [2,4,1,3] => 2
[3,2,1,4] => [4,1,2,3] => 2
[3,2,4,1] => [1,4,2,3] => 1
[3,4,1,2] => [2,1,4,3] => 2
[3,4,2,1] => [1,2,4,3] => 1
[4,1,2,3] => [3,2,1,4] => 3
[4,1,3,2] => [2,3,1,4] => 2
[4,2,1,3] => [3,1,2,4] => 2
[4,2,3,1] => [1,3,2,4] => 1
[4,3,1,2] => [2,1,3,4] => 2
[4,3,2,1] => [1,2,3,4] => 1
[1,2,3,4,5] => [5,4,3,2,1] => 5
[1,2,3,5,4] => [4,5,3,2,1] => 4
[1,2,4,3,5] => [5,3,4,2,1] => 4
[1,2,4,5,3] => [3,5,4,2,1] => 3
[1,2,5,3,4] => [4,3,5,2,1] => 4
[1,2,5,4,3] => [3,4,5,2,1] => 3
[1,3,2,4,5] => [5,4,2,3,1] => 4
[1,3,2,5,4] => [4,5,2,3,1] => 3
[1,3,4,2,5] => [5,2,4,3,1] => 3
[1,3,4,5,2] => [2,5,4,3,1] => 2
[1,3,5,2,4] => [4,2,5,3,1] => 3
[1,3,5,4,2] => [2,4,5,3,1] => 2
[1,4,2,3,5] => [5,3,2,4,1] => 4
[1,4,2,5,3] => [3,5,2,4,1] => 3
[1,4,3,2,5] => [5,2,3,4,1] => 3
[1,4,3,5,2] => [2,5,3,4,1] => 2
[1,4,5,2,3] => [3,2,5,4,1] => 3
Description
The number of left-to-right-minima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a left-to-right-minimum if there does not exist a j < i such that $\sigma_j < \sigma_i$.
Matching statistic: St000011
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [.,.]
=> [1,0]
=> 1
[1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 2
[2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1
[1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 3
[1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 2
[2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 2
[2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 1
[3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 3
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 1
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 3
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 2
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 3
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000015
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00066: Permutations —inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck 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
[1,2] => [1,2] => [1,0,1,0]
=> 2
[2,1] => [2,1] => [1,1,0,0]
=> 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 2
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2
[2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 1
[3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> 2
[3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 3
[1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,4,2,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 3
[1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3
[2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2
[2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 2
[2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 1
[3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 2
[3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2
[3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 1
[3,4,1,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 2
[3,4,2,1] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 1
[4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3
[4,1,3,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 2
[4,2,1,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2
[4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 1
[4,3,1,2] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 2
[4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,5,3,4] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 4
[1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,3,5,2,4] => [1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,4,2,3,5] => [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 4
[1,4,2,5,3] => [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 3
[1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,4,5,2,3] => [1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> 3
Description
The number of peaks of a Dyck path.
Matching statistic: St000069
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> 1
[1,2] => [2,1] => ([],2)
=> 2
[2,1] => [1,2] => ([(0,1)],2)
=> 1
[1,2,3] => [3,2,1] => ([],3)
=> 3
[1,3,2] => [3,1,2] => ([(1,2)],3)
=> 2
[2,1,3] => [2,3,1] => ([(1,2)],3)
=> 2
[2,3,1] => [2,1,3] => ([(0,2),(1,2)],3)
=> 1
[3,1,2] => [1,3,2] => ([(0,1),(0,2)],3)
=> 2
[3,2,1] => [1,2,3] => ([(0,2),(2,1)],3)
=> 1
[1,2,3,4] => [4,3,2,1] => ([],4)
=> 4
[1,2,4,3] => [4,3,1,2] => ([(2,3)],4)
=> 3
[1,3,2,4] => [4,2,3,1] => ([(2,3)],4)
=> 3
[1,3,4,2] => [4,2,1,3] => ([(1,3),(2,3)],4)
=> 2
[1,4,2,3] => [4,1,3,2] => ([(1,2),(1,3)],4)
=> 3
[1,4,3,2] => [4,1,2,3] => ([(1,2),(2,3)],4)
=> 2
[2,1,3,4] => [3,4,2,1] => ([(2,3)],4)
=> 3
[2,1,4,3] => [3,4,1,2] => ([(0,3),(1,2)],4)
=> 2
[2,3,1,4] => [3,2,4,1] => ([(1,3),(2,3)],4)
=> 2
[2,3,4,1] => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> 1
[2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(1,3)],4)
=> 2
[2,4,3,1] => [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> 1
[3,1,2,4] => [2,4,3,1] => ([(1,2),(1,3)],4)
=> 3
[3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(1,3)],4)
=> 2
[3,2,1,4] => [2,3,4,1] => ([(1,2),(2,3)],4)
=> 2
[3,2,4,1] => [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> 1
[3,4,1,2] => [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[3,4,2,1] => [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> 1
[4,1,2,3] => [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
=> 3
[4,1,3,2] => [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 2
[4,2,1,3] => [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 2
[4,2,3,1] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[4,3,1,2] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 2
[4,3,2,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => ([],5)
=> 5
[1,2,3,5,4] => [5,4,3,1,2] => ([(3,4)],5)
=> 4
[1,2,4,3,5] => [5,4,2,3,1] => ([(3,4)],5)
=> 4
[1,2,4,5,3] => [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> 3
[1,2,5,3,4] => [5,4,1,3,2] => ([(2,3),(2,4)],5)
=> 4
[1,2,5,4,3] => [5,4,1,2,3] => ([(2,3),(3,4)],5)
=> 3
[1,3,2,4,5] => [5,3,4,2,1] => ([(3,4)],5)
=> 4
[1,3,2,5,4] => [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> 3
[1,3,4,2,5] => [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> 3
[1,3,4,5,2] => [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> 2
[1,3,5,2,4] => [5,3,1,4,2] => ([(1,4),(2,3),(2,4)],5)
=> 3
[1,3,5,4,2] => [5,3,1,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 2
[1,4,2,3,5] => [5,2,4,3,1] => ([(2,3),(2,4)],5)
=> 4
[1,4,2,5,3] => [5,2,4,1,3] => ([(1,4),(2,3),(2,4)],5)
=> 3
[1,4,3,2,5] => [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> 3
[1,4,3,5,2] => [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> 2
[1,4,5,2,3] => [5,2,1,4,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
Description
The number of maximal elements of a poset.
Matching statistic: St000084
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00015: Binary trees —to ordered tree: right child = right brother⟶ Ordered trees
St000084: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00015: Binary trees —to ordered tree: right child = right brother⟶ Ordered trees
St000084: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [.,.]
=> [[]]
=> 1
[1,2] => [.,[.,.]]
=> [[],[]]
=> 2
[2,1] => [[.,.],.]
=> [[[]]]
=> 1
[1,2,3] => [.,[.,[.,.]]]
=> [[],[],[]]
=> 3
[1,3,2] => [.,[[.,.],.]]
=> [[],[[]]]
=> 2
[2,1,3] => [[.,.],[.,.]]
=> [[[]],[]]
=> 2
[2,3,1] => [[.,[.,.]],.]
=> [[[],[]]]
=> 1
[3,1,2] => [[.,.],[.,.]]
=> [[[]],[]]
=> 2
[3,2,1] => [[[.,.],.],.]
=> [[[[]]]]
=> 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [[],[],[],[]]
=> 4
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [[],[],[[]]]
=> 3
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [[],[[]],[]]
=> 3
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [[],[[],[]]]
=> 2
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [[],[[]],[]]
=> 3
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [[],[[[]]]]
=> 2
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [[[]],[],[]]
=> 3
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [[[]],[[]]]
=> 2
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [[[],[]],[]]
=> 2
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [[[],[],[]]]
=> 1
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [[[],[]],[]]
=> 2
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [[[],[[]]]]
=> 1
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [[[]],[],[]]
=> 3
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [[[]],[[]]]
=> 2
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [[[[]]],[]]
=> 2
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [[[[]],[]]]
=> 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [[[],[]],[]]
=> 2
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [[[[],[]]]]
=> 1
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [[[]],[],[]]
=> 3
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [[[]],[[]]]
=> 2
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [[[[]]],[]]
=> 2
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [[[[]],[]]]
=> 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [[[[]]],[]]
=> 2
[4,3,2,1] => [[[[.,.],.],.],.]
=> [[[[[]]]]]
=> 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [[],[],[],[],[]]
=> 5
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [[],[],[],[[]]]
=> 4
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [[],[],[[]],[]]
=> 4
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [[],[],[[],[]]]
=> 3
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [[],[],[[]],[]]
=> 4
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [[],[],[[[]]]]
=> 3
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [[],[[]],[],[]]
=> 4
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [[],[[]],[[]]]
=> 3
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [[],[[],[]],[]]
=> 3
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [[],[[],[],[]]]
=> 2
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [[],[[],[]],[]]
=> 3
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [[],[[],[[]]]]
=> 2
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [[],[[]],[],[]]
=> 4
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [[],[[]],[[]]]
=> 3
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [[],[[[]]],[]]
=> 3
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [[],[[[]],[]]]
=> 2
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [[],[[],[]],[]]
=> 3
Description
The number of subtrees.
Matching statistic: St001068
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00066: Permutations —inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck 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
[1,2] => [1,2] => [1,0,1,0]
=> 2
[2,1] => [2,1] => [1,1,0,0]
=> 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 2
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2
[2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 1
[3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> 2
[3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 3
[1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,4,2,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 3
[1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3
[2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2
[2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 2
[2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 1
[3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 2
[3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2
[3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 1
[3,4,1,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 2
[3,4,2,1] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 1
[4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3
[4,1,3,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 2
[4,2,1,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2
[4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 1
[4,3,1,2] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 2
[4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,2,5,3,4] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 4
[1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,3,5,2,4] => [1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,4,2,3,5] => [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 4
[1,4,2,5,3] => [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 3
[1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,4,5,2,3] => [1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> 3
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St001184
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001184: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001184: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [.,.]
=> [1,0]
=> 1
[1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 2
[2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1
[1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 3
[1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 2
[2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2
[2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 1
[3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2
[3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,1,0,1,0,1,0,0]
=> 2
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 1
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,0,0,1,0]
=> 1
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 1
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
Description
Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra.
The following 81 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. St000546The number of global descents of a permutation. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000010The length of the partition. St000025The number of initial rises of a Dyck path. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000167The number of leaves of an ordered tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000286The number of connected components of the complement of a graph. St000291The number of descents of a binary word. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000740The last entry of a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000843The decomposition number of a perfect matching. St000908The length of the shortest maximal antichain in a poset. St000912The number of maximal antichains in a poset. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000021The number of descents of a permutation. St000024The number of double up and double down steps of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000133The "bounce" of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000203The number of external nodes of a binary tree. St000234The number of global ascents of a permutation. St000237The number of small exceedances. St000245The number of ascents of a permutation. St000292The number of ascents of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000340The number of non-final maximal constant sub-paths of length greater than one. St000439The position of the first down step of a Dyck path. St000672The number of minimal elements in Bruhat order not less than the permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001180Number of indecomposable injective modules with projective dimension at most 1. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. 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. St001489The maximum of the number of descents and the number of inverse descents. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000061The number of nodes on the left branch of a binary tree. St000654The first descent of a permutation. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000702The number of weak deficiencies of a permutation. St000914The sum of the values of the Möbius function of a poset. St000925The number of topologically connected components of a set partition. St000990The first ascent of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000354The number of recoils of a permutation. St000989The number of final rises of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000159The number of distinct parts of the integer partition. St000068The number of minimal elements in a poset. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St001863The number of weak excedances of a signed permutation. St000942The number of critical left to right maxima of the parking functions. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001712The number of natural descents of a standard Young tableau. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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$. St001621The number of atoms of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L.
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!