searching the database
Your data matches 290 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: St000331
(load all 29 compositions to match this statistic)
(load all 29 compositions to match this statistic)
St000331: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 2
[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]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
The number of upper interactions of a Dyck path.
An ''upper interaction'' in a Dyck path is defined as the occurrence of a factor '''$A^{k}$$B^{k}$''' for any '''${k ≥ 1}$''', where '''${A}$''' is a down-step and '''${B}$''' is a up-step.
Matching statistic: St000672
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00326: Permutations —weak order rowmotion⟶ Permutations
St000672: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00326: Permutations —weak order rowmotion⟶ Permutations
St000672: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [1,2] => 1
[1,1,0,0]
=> [1,2] => [2,1] => 0
[1,0,1,0,1,0]
=> [3,2,1] => [1,2,3] => 2
[1,0,1,1,0,0]
=> [2,3,1] => [2,1,3] => 1
[1,1,0,0,1,0]
=> [3,1,2] => [1,3,2] => 1
[1,1,0,1,0,0]
=> [2,1,3] => [3,1,2] => 1
[1,1,1,0,0,0]
=> [1,2,3] => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [1,2,3,4] => 3
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [3,1,2,4] => 2
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [2,4,1,3] => 2
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [2,3,1,4] => 2
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [3,2,1,4] => 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [1,3,4,2] => 2
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [3,1,4,2] => 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [1,2,4,3] => 2
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [4,1,2,3] => 2
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [4,2,1,3] => 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [1,4,3,2] => 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [4,1,3,2] => 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [4,3,1,2] => 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [1,2,3,4,5] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [4,1,2,3,5] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [3,5,1,2,4] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [3,4,1,2,5] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [4,3,1,2,5] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [2,4,5,1,3] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [4,2,5,1,3] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [2,3,5,1,4] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [2,3,4,1,5] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [3,2,4,1,5] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [2,5,3,1,4] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [2,4,3,1,5] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [4,2,3,1,5] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [4,3,2,1,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [1,3,4,5,2] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [4,1,3,5,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [3,5,1,4,2] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [3,4,1,5,2] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [4,3,1,5,2] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [1,2,4,5,3] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [4,1,2,5,3] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [1,2,3,5,4] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [5,1,2,3,4] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [5,3,1,2,4] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [2,5,4,1,3] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [5,2,4,1,3] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [5,2,3,1,4] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [5,3,2,1,4] => 1
Description
The number of minimal elements in Bruhat order not less than the permutation.
The minimal elements in question are biGrassmannian, that is
$$1\dots r\ \ a+1\dots b\ \ r+1\dots a\ \ b+1\dots$$
for some $(r,a,b)$.
This is also the size of Fulton's essential set of the reverse permutation, according to [ex.4.7, 2].
Matching statistic: St000021
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000021: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000021: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> [1] => [1] => 0
[1,0,1,0]
=> [.,[.,.]]
=> [2,1] => [2,1] => 1
[1,1,0,0]
=> [[.,.],.]
=> [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 2
[1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> [2,3,1] => [2,3,1] => 1
[1,1,0,0,1,0]
=> [[.,.],[.,.]]
=> [1,3,2] => [3,1,2] => 1
[1,1,0,1,0,0]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 1
[1,1,1,0,0,0]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 3
[1,0,1,0,1,1,0,0]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [3,4,2,1] => 2
[1,0,1,1,0,0,1,0]
=> [.,[[.,.],[.,.]]]
=> [2,4,3,1] => [4,2,3,1] => 2
[1,0,1,1,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [3,2,4,1] => 2
[1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [2,3,4,1] => 1
[1,1,0,0,1,0,1,0]
=> [[.,.],[.,[.,.]]]
=> [1,4,3,2] => [4,3,1,2] => 2
[1,1,0,0,1,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,3,4,2] => [3,1,4,2] => 2
[1,1,0,1,0,0,1,0]
=> [[.,[.,.]],[.,.]]
=> [2,1,4,3] => [4,2,1,3] => 2
[1,1,0,1,0,1,0,0]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 2
[1,1,0,1,1,0,0,0]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [2,3,1,4] => 1
[1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> [1,2,4,3] => [4,1,2,3] => 1
[1,1,1,0,0,1,0,0]
=> [[[.,.],[.,.]],.]
=> [1,3,2,4] => [3,1,2,4] => 1
[1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => [4,5,3,2,1] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => [5,3,4,2,1] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => [4,3,5,2,1] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => [3,4,5,2,1] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => [5,4,2,3,1] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => [4,2,5,3,1] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => [4,3,2,5,1] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => [3,4,2,5,1] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => [5,2,3,4,1] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => [4,2,3,5,1] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> [3,2,4,5,1] => [3,2,4,5,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> [2,3,4,5,1] => [2,3,4,5,1] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,5,4,3,2] => [5,4,3,1,2] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> [1,4,5,3,2] => [4,5,1,3,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,3,5,4,2] => [5,3,1,4,2] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> [1,4,3,5,2] => [4,3,1,5,2] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,3,4,5,2] => [3,1,4,5,2] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [[.,[.,.]],[.,[.,.]]]
=> [2,1,5,4,3] => [5,4,2,1,3] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [2,1,4,5,3] => [4,2,1,5,3] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [3,2,1,5,4] => [5,3,2,1,4] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [3,4,2,1,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],.]],[.,.]]
=> [2,3,1,5,4] => [5,2,3,1,4] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [[.,[[.,.],[.,.]]],.]
=> [2,4,3,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [3,2,4,1,5] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [2,3,4,1,5] => 1
Description
The number of descents of a permutation.
This can be described as an occurrence of the vincular mesh pattern ([2,1], {(1,0),(1,1),(1,2)}), i.e., the middle column is shaded, see [3].
Matching statistic: St000245
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000245: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000245: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => [1,2] => 1
[1,1,0,0]
=> [2,1] => [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 2
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => [3,1,2] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 3
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => [1,2,4,3] => 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => [1,3,2,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,4,1,2] => [1,4,2,3] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => [1,4,3,2] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,1,3] => [1,3,4,2] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => [3,1,2,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => [4,1,2,3] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => [4,1,3,2] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => [4,2,1,3] => 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => [4,3,1,2] => 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => [1,2,3,5,4] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => [1,2,4,3,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,5,1,2,3] => [1,2,5,3,4] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => [1,2,5,4,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => [1,3,2,4,5] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,5,1,2,4] => [1,2,4,5,3] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,4,1,2,5] => [1,4,2,3,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,4,5,1,2] => [1,5,2,3,4] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,4,1,2] => [1,5,2,4,3] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => [1,4,3,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,5,1,2] => [1,5,3,2,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,3,1,2] => [1,5,4,2,3] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => [1,5,4,3,2] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,5,1,3,4] => [1,3,2,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,4,1,3,5] => [1,3,4,2,5] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,5,1,3] => [1,3,5,2,4] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,2,4,1,3] => [1,3,5,4,2] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => [3,1,2,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,3,5,1,4] => [1,3,4,5,2] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => [4,1,2,3,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => [5,1,2,3,4] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => [5,1,2,4,3] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => [4,1,3,2,5] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => [5,1,3,2,4] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,5,2,3,1] => [5,1,4,2,3] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => [5,1,4,3,2] => 1
Description
The number of ascents of a permutation.
Matching statistic: St000836
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000836: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000836: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [2,3,1,4,5] => 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,1] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [4,5,3,2,1,6] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [6,3,4,2,1,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [4,5,3,2,6,1] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,4,2,1,5,6] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,1,4] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,1,2] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,4,2,5,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,2,1] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,1,6] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [5,2,3,1,4,6] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [6,2,3,1,4,5] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,6,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [2,3,1,4,5,6] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,2,3] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,1,3] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,1,2] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,4,5,1,2,6] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,1,2] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [3,4,5,2,1,6] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [5,2,3,4,1,6] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,1,5] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [3,4,5,2,6,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [2,3,4,1,5,6] => 1
Description
The number of descents of distance 2 of a permutation.
This is, $\operatorname{des}_2(\pi) = | \{ i : \pi(i) > \pi(i+2) \} |$.
Matching statistic: St001489
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St001489: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St001489: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> [1] => [1] => 0
[1,0,1,0]
=> [.,[.,.]]
=> [2,1] => [2,1] => 1
[1,1,0,0]
=> [[.,.],.]
=> [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 2
[1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> [2,3,1] => [3,1,2] => 1
[1,1,0,0,1,0]
=> [[.,.],[.,.]]
=> [1,3,2] => [2,3,1] => 1
[1,1,0,1,0,0]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 1
[1,1,1,0,0,0]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 3
[1,0,1,0,1,1,0,0]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [4,3,1,2] => 2
[1,0,1,1,0,0,1,0]
=> [.,[[.,.],[.,.]]]
=> [2,4,3,1] => [4,2,3,1] => 2
[1,0,1,1,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [4,2,1,3] => 2
[1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [4,1,2,3] => 1
[1,1,0,0,1,0,1,0]
=> [[.,.],[.,[.,.]]]
=> [1,4,3,2] => [3,4,2,1] => 2
[1,1,0,0,1,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,3,4,2] => [2,4,1,3] => 2
[1,1,0,1,0,0,1,0]
=> [[.,[.,.]],[.,.]]
=> [2,1,4,3] => [3,2,4,1] => 2
[1,1,0,1,0,1,0,0]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 2
[1,1,0,1,1,0,0,0]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [3,1,2,4] => 1
[1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> [1,2,4,3] => [2,3,4,1] => 1
[1,1,1,0,0,1,0,0]
=> [[[.,.],[.,.]],.]
=> [1,3,2,4] => [2,3,1,4] => 1
[1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => [5,4,3,1,2] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => [5,4,2,3,1] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => [5,4,2,1,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => [5,4,1,2,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => [5,3,4,2,1] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => [5,2,4,1,3] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => [5,3,2,1,4] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => [5,3,1,2,4] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => [5,2,3,4,1] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => [5,2,3,1,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> [3,2,4,5,1] => [5,2,1,3,4] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> [2,3,4,5,1] => [5,1,2,3,4] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,5,4,3,2] => [4,5,3,2,1] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> [1,4,5,3,2] => [3,5,4,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,3,5,4,2] => [3,5,2,4,1] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> [1,4,3,5,2] => [3,5,2,1,4] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,3,4,5,2] => [2,5,1,3,4] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [[.,[.,.]],[.,[.,.]]]
=> [2,1,5,4,3] => [4,3,5,2,1] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [2,1,4,5,3] => [3,2,5,1,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [3,2,1,5,4] => [4,3,2,5,1] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [4,3,1,2,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],.]],[.,.]]
=> [2,3,1,5,4] => [4,2,3,5,1] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [[.,[[.,.],[.,.]]],.]
=> [2,4,3,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [4,2,1,3,5] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [4,1,2,3,5] => 1
Description
The maximum of the number of descents and the number of inverse descents.
This is, the maximum of [[St000021]] and [[St000354]].
Matching statistic: St000325
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000325: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000325: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> [1] => [1] => 1 = 0 + 1
[1,0,1,0]
=> [.,[.,.]]
=> [2,1] => [2,1] => 2 = 1 + 1
[1,1,0,0]
=> [[.,.],.]
=> [1,2] => [1,2] => 1 = 0 + 1
[1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 3 = 2 + 1
[1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> [2,3,1] => [2,3,1] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [[.,.],[.,.]]
=> [1,3,2] => [3,1,2] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 2 = 1 + 1
[1,1,1,0,0,0]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [3,4,2,1] => 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [.,[[.,.],[.,.]]]
=> [2,4,3,1] => [4,2,3,1] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [3,2,4,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [2,3,4,1] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [[.,.],[.,[.,.]]]
=> [1,4,3,2] => [4,3,1,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,3,4,2] => [3,1,4,2] => 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [[.,[.,.]],[.,.]]
=> [2,1,4,3] => [4,2,1,3] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [2,3,1,4] => 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> [1,2,4,3] => [4,1,2,3] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [[[.,.],[.,.]],.]
=> [1,3,2,4] => [3,1,2,4] => 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => [4,5,3,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => [5,3,4,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => [4,3,5,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => [3,4,5,2,1] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => [5,4,2,3,1] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => [4,2,5,3,1] => 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => [5,3,2,4,1] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => [4,3,2,5,1] => 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => [3,4,2,5,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => [5,2,3,4,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => [4,2,3,5,1] => 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> [3,2,4,5,1] => [3,2,4,5,1] => 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> [2,3,4,5,1] => [2,3,4,5,1] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,5,4,3,2] => [5,4,3,1,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> [1,4,5,3,2] => [4,5,1,3,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,3,5,4,2] => [5,3,1,4,2] => 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> [1,4,3,5,2] => [4,3,1,5,2] => 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,3,4,5,2] => [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [[.,[.,.]],[.,[.,.]]]
=> [2,1,5,4,3] => [5,4,2,1,3] => 4 = 3 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [2,1,4,5,3] => [4,2,1,5,3] => 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [3,2,1,5,4] => [5,3,2,1,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 4 = 3 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [3,4,2,1,5] => 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],.]],[.,.]]
=> [2,3,1,5,4] => [5,2,3,1,4] => 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [[.,[[.,.],[.,.]]],.]
=> [2,4,3,1,5] => [4,2,3,1,5] => 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [3,2,4,1,5] => 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [2,3,4,1,5] => 2 = 1 + 1
Description
The width of the tree associated to a permutation.
A permutation can be mapped to a rooted tree with vertices $\{0,1,2,\ldots,n\}$ and root $0$ in the following way. Entries of the permutations are inserted one after the other, each child is larger than its parent and the children are in strict order from left to right. Details of the construction are found in [1].
The width of the tree is given by the number of leaves of this tree.
Note that, due to the construction of this tree, the width of the tree is always one more than the number of descents [[St000021]]. This also matches the number of runs in a permutation [[St000470]].
See also [[St000308]] for the height of this tree.
Matching statistic: St000470
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000470: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St000470: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> [1] => [1] => 1 = 0 + 1
[1,0,1,0]
=> [.,[.,.]]
=> [2,1] => [2,1] => 2 = 1 + 1
[1,1,0,0]
=> [[.,.],.]
=> [1,2] => [1,2] => 1 = 0 + 1
[1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 3 = 2 + 1
[1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> [2,3,1] => [2,3,1] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [[.,.],[.,.]]
=> [1,3,2] => [3,1,2] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 2 = 1 + 1
[1,1,1,0,0,0]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [3,4,2,1] => 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [.,[[.,.],[.,.]]]
=> [2,4,3,1] => [4,2,3,1] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [3,2,4,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [2,3,4,1] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [[.,.],[.,[.,.]]]
=> [1,4,3,2] => [4,3,1,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,3,4,2] => [3,1,4,2] => 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [[.,[.,.]],[.,.]]
=> [2,1,4,3] => [4,2,1,3] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [2,3,1,4] => 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> [1,2,4,3] => [4,1,2,3] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [[[.,.],[.,.]],.]
=> [1,3,2,4] => [3,1,2,4] => 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => [4,5,3,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => [5,3,4,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => [4,3,5,2,1] => 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => [3,4,5,2,1] => 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => [5,4,2,3,1] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => [4,2,5,3,1] => 4 = 3 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => [5,3,2,4,1] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => [4,3,2,5,1] => 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => [3,4,2,5,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => [5,2,3,4,1] => 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => [4,2,3,5,1] => 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> [3,2,4,5,1] => [3,2,4,5,1] => 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> [2,3,4,5,1] => [2,3,4,5,1] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,5,4,3,2] => [5,4,3,1,2] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> [1,4,5,3,2] => [4,5,1,3,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,3,5,4,2] => [5,3,1,4,2] => 4 = 3 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> [1,4,3,5,2] => [4,3,1,5,2] => 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,3,4,5,2] => [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [[.,[.,.]],[.,[.,.]]]
=> [2,1,5,4,3] => [5,4,2,1,3] => 4 = 3 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [2,1,4,5,3] => [4,2,1,5,3] => 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [3,2,1,5,4] => [5,3,2,1,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 4 = 3 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [3,4,2,1,5] => 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],.]],[.,.]]
=> [2,3,1,5,4] => [5,2,3,1,4] => 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [[.,[[.,.],[.,.]]],.]
=> [2,4,3,1,5] => [4,2,3,1,5] => 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [3,2,4,1,5] => 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [2,3,4,1,5] => 2 = 1 + 1
Description
The number of runs in a permutation.
A run in a permutation is an inclusion-wise maximal increasing substring, i.e., a contiguous subsequence.
This is the same as the number of descents plus 1.
Matching statistic: St000144
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000144: Dyck paths ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000144: Dyck paths ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 1 + 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 2 + 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 1 + 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 1 + 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 1 + 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 1 + 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 2 + 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 4 = 2 + 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4 = 2 + 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 2 + 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 1 + 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 5 = 3 + 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 5 = 3 + 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 5 = 3 + 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 4 = 2 + 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 5 = 3 + 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 5 = 3 + 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 4 = 2 + 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 5 = 3 + 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 5 = 3 + 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 5 = 3 + 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5 = 3 + 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 4 = 2 + 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 4 = 2 + 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 0 + 2
Description
The pyramid weight of the Dyck path.
The pyramid weight of a Dyck path is the sum of the lengths of the maximal pyramids (maximal sequences of the form $1^h0^h$) in the path.
Maximal pyramids are called lower interactions by Le Borgne [2], see [[St000331]] and [[St000335]] for related statistics.
Matching statistic: St000354
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000354: Permutations ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000354: Permutations ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> [1] => [1] => ? = 0
[1,0,1,0]
=> [.,[.,.]]
=> [2,1] => [2,1] => 1
[1,1,0,0]
=> [[.,.],.]
=> [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 2
[1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> [2,3,1] => [3,1,2] => 1
[1,1,0,0,1,0]
=> [[.,.],[.,.]]
=> [1,3,2] => [2,3,1] => 1
[1,1,0,1,0,0]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 1
[1,1,1,0,0,0]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 3
[1,0,1,0,1,1,0,0]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [4,3,1,2] => 2
[1,0,1,1,0,0,1,0]
=> [.,[[.,.],[.,.]]]
=> [2,4,3,1] => [4,2,3,1] => 2
[1,0,1,1,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [4,2,1,3] => 2
[1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [4,1,2,3] => 1
[1,1,0,0,1,0,1,0]
=> [[.,.],[.,[.,.]]]
=> [1,4,3,2] => [3,4,2,1] => 2
[1,1,0,0,1,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,3,4,2] => [2,4,1,3] => 2
[1,1,0,1,0,0,1,0]
=> [[.,[.,.]],[.,.]]
=> [2,1,4,3] => [3,2,4,1] => 2
[1,1,0,1,0,1,0,0]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 2
[1,1,0,1,1,0,0,0]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [3,1,2,4] => 1
[1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> [1,2,4,3] => [2,3,4,1] => 1
[1,1,1,0,0,1,0,0]
=> [[[.,.],[.,.]],.]
=> [1,3,2,4] => [2,3,1,4] => 1
[1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => [5,4,3,1,2] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => [5,4,2,3,1] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => [5,4,2,1,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => [5,4,1,2,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => [5,3,4,2,1] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => [5,2,4,1,3] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => [5,3,2,1,4] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => [5,3,1,2,4] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => [5,2,3,4,1] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => [5,2,3,1,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> [3,2,4,5,1] => [5,2,1,3,4] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> [2,3,4,5,1] => [5,1,2,3,4] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,5,4,3,2] => [4,5,3,2,1] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> [1,4,5,3,2] => [3,5,4,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,3,5,4,2] => [3,5,2,4,1] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> [1,4,3,5,2] => [3,5,2,1,4] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,3,4,5,2] => [2,5,1,3,4] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [[.,[.,.]],[.,[.,.]]]
=> [2,1,5,4,3] => [4,3,5,2,1] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [2,1,4,5,3] => [3,2,5,1,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [3,2,1,5,4] => [4,3,2,5,1] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [4,3,1,2,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],.]],[.,.]]
=> [2,3,1,5,4] => [4,2,3,5,1] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [[.,[[.,.],[.,.]]],.]
=> [2,4,3,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [4,2,1,3,5] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [4,1,2,3,5] => 1
[1,1,1,0,0,0,1,0,1,0]
=> [[[.,.],.],[.,[.,.]]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 2
Description
The number of recoils of a permutation.
A '''recoil''', or '''inverse descent''' of a permutation $\pi$ is a value $i$ such that $i+1$ appears to the left of $i$ in $\pi_1,\pi_2,\dots,\pi_n$.
In other words, this is the number of descents of the inverse permutation. It can be also be described as the number of occurrences of the mesh pattern $([2,1], {(0,1),(1,1),(2,1)})$, i.e., the middle row is shaded.
The following 280 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000829The Ulam distance of a permutation to the identity permutation. St000837The number of ascents of distance 2 of a permutation. St000291The number of descents of a binary word. St001432The order dimension of the partition. St000336The leg major index of a standard tableau. St000632The jump number of the poset. St001741The largest integer such that all patterns of this size are contained in the permutation. St000662The staircase size of the code of a permutation. St001863The number of weak excedances of a signed permutation. St001330The hat guessing number of a graph. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001645The pebbling number of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001668The number of points of the poset minus the width of the poset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000039The number of crossings of a permutation. St001298The number of repeated entries in the Lehmer code of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St000493The los statistic of a set partition. St000497The lcb statistic of a set partition. St000907The number of maximal antichains of minimal length in a poset. St001626The number of maximal proper sublattices of a lattice. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000352The Elizalde-Pak rank of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001435The number of missing boxes in the first row. St001488The number of corners of a skew partition. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000834The number of right outer peaks of a permutation. St000153The number of adjacent cycles of a permutation. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St000568The hook number of a binary tree. St000659The number of rises of length at least 2 of a Dyck path. St000919The number of maximal left branches of a binary tree. St000932The number of occurrences of the pattern UDU in a Dyck path. 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)$. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000098The chromatic number of a graph. St000451The length of the longest pattern of the form k 1 2. St000366The number of double descents of a permutation. St000871The number of very big ascents of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001115The number of even descents of a permutation. St001394The genus of a permutation. St000035The number of left outer peaks of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000884The number of isolated descents of a permutation. St001581The achromatic number of a graph. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000390The number of runs of ones in a binary word. St000356The number of occurrences of the pattern 13-2. St000850The number of 1/2-balanced pairs in a poset. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000201The number of leaf nodes in a binary tree. St000214The number of adjacencies of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St000071The number of maximal chains in a poset. St001060The distinguishing index of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001864The number of excedances of a signed permutation. St001896The number of right descents of a signed permutations. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000023The number of inner peaks of a permutation. St000353The number of inner valleys of a permutation. 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. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001712The number of natural descents of a standard Young tableau. St001840The number of descents of a set partition. 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. St000308The height of the tree associated to a permutation. St000502The number of successions of a set partitions. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St001061The number of indices that are both descents and recoils of a permutation. St001737The number of descents of type 2 in a permutation. 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. St000004The major index of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000080The rank of the poset. St000083The number of left oriented leafs of a binary tree except the first one. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000174The flush statistic of a semistandard tableau. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000386The number of factors DDU in a Dyck path. St000640The rank of the largest boolean interval in a poset. St000650The number of 3-rises of a permutation. St000653The last descent of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000779The tier of a permutation. St000794The mak of a permutation. St000872The number of very big descents of a permutation. St000961The shifted major index of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000989The number of final rises of a permutation. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. 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. 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. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001388The number of non-attacking neighbors of a permutation. St001423The number of distinct cubes in a binary word. St001520The number of strict 3-descents. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001665The number of pure excedances of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001726The number of visible inversions of a permutation. 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. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001823The Stasinski-Voll length of a signed permutation. St001839The number of excedances of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001862The number of crossings of a signed permutation. St001874Lusztig's a-function for the symmetric group. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001928The number of non-overlapping descents in a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000015The number of peaks of a Dyck path. St000053The number of valleys of the Dyck path. St000056The decomposition (or block) number of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000238The number of indices that are not small weak excedances. St000254The nesting number of a set partition. St000272The treewidth of a graph. St000292The number of ascents of a binary word. St000307The number of rowmotion orbits of a poset. St000314The number of left-to-right-maxima of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000340The number of non-final maximal constant sub-paths of length greater than one. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000536The pathwidth of a graph. St000619The number of cyclic descents of a permutation. St000702The number of weak deficiencies of a permutation. St000831The number of indices that are either descents or recoils. St000864The number of circled entries of the shifted recording tableau of a permutation. St000925The number of topologically connected components of a set partition. St000942The number of critical left to right maxima of the parking functions. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000991The number of right-to-left minima of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001114The number of odd descents of a permutation. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001220The width of a permutation. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. 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. St001274The number of indecomposable injective modules with projective dimension equal to two. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001393The induced matching number of a graph. St001405The number of bonds in a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001512The minimum rank of a graph. St001530The depth of a Dyck path. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001732The number of peaks visible from the left. St001734The lettericity of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001812The biclique partition number of a graph. St000172The Grundy number of a graph. St000504The cardinality of the first block of a set partition. St000820The number of compositions obtained by rotating the composition. St000822The Hadwiger number of the graph. St000918The 2-limited packing number of a graph. St001029The size of the core of a graph. St001062The maximal size of a block of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001116The game chromatic number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We 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:
St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001261The Castelnuovo-Mumford regularity of a graph. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001471The magnitude of a Dyck path. St001494The Alon-Tarsi number of a graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001580The acyclic chromatic number of a graph. St001670The connected partition number of a graph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001902The number of potential covers of a poset. St001963The tree-depth of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000735The last entry on the main diagonal of a standard tableau. St000741The Colin de Verdière graph invariant. St000454The largest eigenvalue of a graph if it is integral. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation.
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!