searching the database
Your data matches 208 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: St000117
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
St000117: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The number of centered tunnels of a Dyck path.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b==n then the tunnel is called centered.
Matching statistic: St001008
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
St001008: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 3 - 1
Description
Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000022
(load all 107 compositions to match this statistic)
(load all 107 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000022: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000022: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,2] => 2 = 3 - 1
[1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,2,3] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,1,2] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => 0 = 1 - 1
Description
The number of fixed points of a permutation.
Matching statistic: St000221
(load all 269 compositions to match this statistic)
(load all 269 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000221: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000221: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,2] => 2 = 3 - 1
[1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,2,3] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,2,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 0 = 1 - 1
Description
The number of strong fixed points of a permutation.
$i$ is called a strong fixed point of $\pi$ if
1. $j < i$ implies $\pi_j < \pi_i$, and
2. $j > i$ implies $\pi_j > \pi_i$
This can be described as an occurrence of the mesh pattern ([1], {(0,1),(1,0)}), i.e., the upper left and the lower right quadrants are shaded, see [3].
The generating function for the joint-distribution (RLmin, LRmax, strong fixed points) has a continued fraction expression as given in [4, Lemma 3.2], for LRmax see [[St000314]].
Matching statistic: St000241
(load all 39 compositions to match this statistic)
(load all 39 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000241: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000241: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [2,1] => 2 = 3 - 1
[1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [3,2,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,3,1] => 3 = 4 - 1
[1,1,0,0,1,0]
=> [3,1,2] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 4 = 5 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 5 = 6 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 3 = 4 - 1
Description
The number of cyclical small excedances.
A cyclical small excedance is an index $i$ such that $\pi_i = i+1$ considered cyclically.
Matching statistic: St000895
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000895: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000895: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> 1 = 2 - 1
[1,0,1,0]
=> [[1,0],[0,1]]
=> 2 = 3 - 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 0 = 1 - 1
Description
The number of ones on the main diagonal of an alternating sign matrix.
Matching statistic: St000011
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 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,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 1
[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,0,0,1,0,1,0]
=> 3
[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,1,0,0,1,0,0,0]
=> 1
[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,1,1,0,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,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,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 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,0,1,0,0,1,1,0,1,0,0]
=> 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,0,1,1,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 2
[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,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 4
[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,1,1,0,1,0,0,0,0]
=> 1
[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,1,0,1,0,0,0,1,0]
=> 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,1,0,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 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,0,1,1,0,0,1,0,0]
=> 1
[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]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 1
[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,0,1,0,0,1,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: St000674
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 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]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[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,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 1
[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,0,1,0,1,0]
=> 2
[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]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 3
[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,1,0,0,1,0]
=> 1
[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,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 1
[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,0,1,1,0,0,1,0,1,0]
=> 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,0,1,1,1,0,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 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,0,0,1,0,1,0,1,0,1,0]
=> 4
[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,1,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 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,1,0,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[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,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 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,1,0,1,0,1,0,0,0,1,0]
=> 1
[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,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 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,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4
Description
The number of hills of a Dyck path.
A hill is a peak with up step starting and down step ending at height zero.
Matching statistic: St000164
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
Mp00116: Perfect matchings —Kasraoui-Zeng⟶ Perfect matchings
St000164: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00116: Perfect matchings —Kasraoui-Zeng⟶ Perfect matchings
St000164: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [(1,2)]
=> [(1,2)]
=> 1 = 2 - 1
[1,0,1,0]
=> [(1,2),(3,4)]
=> [(1,2),(3,4)]
=> 2 = 3 - 1
[1,1,0,0]
=> [(1,4),(2,3)]
=> [(1,3),(2,4)]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> [(1,2),(3,4),(5,6)]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> [(1,2),(3,5),(4,6)]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [(1,4),(2,3),(5,6)]
=> [(1,3),(2,4),(5,6)]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> [(1,3),(2,5),(4,6)]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> [(1,4),(2,5),(3,6)]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> [(1,2),(3,4),(5,7),(6,8)]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8)]
=> [(1,2),(3,5),(4,6),(7,8)]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> [(1,2),(3,5),(4,7),(6,8)]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> [(1,2),(3,6),(4,7),(5,8)]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8)]
=> [(1,3),(2,4),(5,6),(7,8)]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [(1,4),(2,3),(5,8),(6,7)]
=> [(1,3),(2,4),(5,7),(6,8)]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8)]
=> [(1,3),(2,5),(4,6),(7,8)]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> [(1,3),(2,5),(4,7),(6,8)]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [(1,8),(2,3),(4,7),(5,6)]
=> [(1,3),(2,6),(4,7),(5,8)]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8)]
=> [(1,4),(2,5),(3,6),(7,8)]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> [(1,4),(2,5),(3,7),(6,8)]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> [(1,4),(2,6),(3,7),(5,8)]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> [(1,5),(2,6),(3,7),(4,8)]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,10),(8,9)]
=> [(1,2),(3,4),(5,6),(7,9),(8,10)]
=> 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [(1,2),(3,4),(5,8),(6,7),(9,10)]
=> [(1,2),(3,4),(5,7),(6,8),(9,10)]
=> 3 = 4 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> [(1,2),(3,4),(5,7),(6,9),(8,10)]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,10),(6,9),(7,8)]
=> [(1,2),(3,4),(5,8),(6,9),(7,10)]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8),(9,10)]
=> [(1,2),(3,5),(4,6),(7,8),(9,10)]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [(1,2),(3,6),(4,5),(7,10),(8,9)]
=> [(1,2),(3,5),(4,6),(7,9),(8,10)]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [(1,2),(3,8),(4,5),(6,7),(9,10)]
=> [(1,2),(3,5),(4,7),(6,8),(9,10)]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> [(1,2),(3,5),(4,7),(6,9),(8,10)]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [(1,2),(3,10),(4,5),(6,9),(7,8)]
=> [(1,2),(3,5),(4,8),(6,9),(7,10)]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [(1,2),(3,8),(4,7),(5,6),(9,10)]
=> [(1,2),(3,6),(4,7),(5,8),(9,10)]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> [(1,2),(3,6),(4,7),(5,9),(8,10)]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,10),(4,9),(5,6),(7,8)]
=> [(1,2),(3,6),(4,8),(5,9),(7,10)]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,10),(4,9),(5,8),(6,7)]
=> [(1,2),(3,7),(4,8),(5,9),(6,10)]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8),(9,10)]
=> [(1,3),(2,4),(5,6),(7,8),(9,10)]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [(1,4),(2,3),(5,6),(7,10),(8,9)]
=> [(1,3),(2,4),(5,6),(7,9),(8,10)]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [(1,4),(2,3),(5,8),(6,7),(9,10)]
=> [(1,3),(2,4),(5,7),(6,8),(9,10)]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [(1,4),(2,3),(5,10),(6,7),(8,9)]
=> [(1,3),(2,4),(5,7),(6,9),(8,10)]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [(1,4),(2,3),(5,10),(6,9),(7,8)]
=> [(1,3),(2,4),(5,8),(6,9),(7,10)]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8),(9,10)]
=> [(1,3),(2,5),(4,6),(7,8),(9,10)]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [(1,6),(2,3),(4,5),(7,10),(8,9)]
=> [(1,3),(2,5),(4,6),(7,9),(8,10)]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [(1,8),(2,3),(4,5),(6,7),(9,10)]
=> [(1,3),(2,5),(4,7),(6,8),(9,10)]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> [(1,3),(2,5),(4,7),(6,9),(8,10)]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [(1,10),(2,3),(4,5),(6,9),(7,8)]
=> [(1,3),(2,5),(4,8),(6,9),(7,10)]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [(1,8),(2,3),(4,7),(5,6),(9,10)]
=> [(1,3),(2,6),(4,7),(5,8),(9,10)]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [(1,10),(2,3),(4,7),(5,6),(8,9)]
=> [(1,3),(2,6),(4,7),(5,9),(8,10)]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [(1,10),(2,3),(4,9),(5,6),(7,8)]
=> [(1,3),(2,6),(4,8),(5,9),(7,10)]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [(1,10),(2,3),(4,9),(5,8),(6,7)]
=> [(1,3),(2,7),(4,8),(5,9),(6,10)]
=> 0 = 1 - 1
Description
The number of short pairs.
A short pair is a matching pair of the form $(i,i+1)$.
Matching statistic: St000215
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
St000215: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
St000215: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [2,1] => 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => 1 = 2 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,4,1,2] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,1,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,5,1,2,3] => 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,5,1,2,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,4,1,2,5] => 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,4,5,1,2] => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,4,1,2] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,5,1,2] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,3,1,2] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,5,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,4,1,3,5] => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,5,1,3] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,2,4,1,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,3,5,1,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,5,2,3,1] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => 2 = 3 - 1
Description
The number of adjacencies of a permutation, zero appended.
An adjacency is a descent of the form $(e+1,e)$ in the word corresponding to the permutation in one-line notation. This statistic, $\operatorname{adj_0}$, counts adjacencies in the word with a zero appended.
$(\operatorname{adj_0}, \operatorname{des})$ and $(\operatorname{fix}, \operatorname{exc})$ are equidistributed, see [1].
The following 198 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000234The number of global ascents of a permutation. St000315The number of isolated vertices of a graph. St000475The number of parts equal to 1 in a partition. St000025The number of initial rises of a Dyck path. St000160The multiplicity of the smallest part of a partition. St000247The number of singleton blocks of a set partition. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000925The number of topologically connected components of a set partition. St000288The number of ones in a binary word. St000439The position of the first down step of a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000502The number of successions of a set partitions. St000932The number of occurrences of the pattern UDU in a Dyck path. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001479The number of bridges of a graph. St001691The number of kings in a graph. St000461The rix statistic of a permutation. St000873The aix statistic of a permutation. St000248The number of anti-singletons of a set partition. St001672The restrained domination number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St001462The number of factors of a standard tableaux under concatenation. St000717The number of ordinal summands of a poset. St000993The multiplicity of the largest part of an integer partition. St000441The number of successions of a permutation. St000907The number of maximal antichains of minimal length in a poset. St000006The dinv of a Dyck path. St000015The number of peaks of a Dyck path. St000443The number of long tunnels of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000532The total number of rook placements on a Ferrers board. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000733The row containing the largest entry of a standard tableau. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001161The major index north count of a Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama 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:
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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001530The depth of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. St001814The number of partitions interlacing the given partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001933The largest multiplicity of a part in an integer partition. St001432The order dimension of the partition. St000894The trace of an alternating sign matrix. St000937The number of positive values of the symmetric group character corresponding to the partition. St001568The smallest positive integer that does not appear twice in the partition. St000237The number of small exceedances. St000335The difference of lower and upper interactions. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000007The number of saliances of the permutation. St000546The number of global descents of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000327The number of cover relations in a poset. St000444The length of the maximal rise of a Dyck path. St000744The length of the path to the largest entry in a standard Young tableau. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000153The number of adjacent cycles of a permutation. St000668The least common multiple of the parts of the partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St001128The exponens consonantiae of a partition. St000214The number of adjacencies of a permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000843The decomposition number of a perfect matching. St000729The minimal arc length of a set partition. St000884The number of isolated descents of a permutation. St000313The number of degree 2 vertices of a graph. St000504The cardinality of the first block of a set partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. 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. St000056The decomposition (or block) number of a permutation. St000456The monochromatic index of a connected graph. St000239The number of small weak excedances. St000061The number of nodes on the left branch of a binary tree. St000084The number of subtrees. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000553The number of blocks of a graph. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group 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. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000667The greatest common divisor of the parts of the partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000870The product of the hook lengths of the diagonal cells in an integer partition. 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$. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001780The order of promotion on the set of standard tableaux of given shape. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001118The acyclic chromatic index 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$. 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$. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000648The number of 2-excedences of a permutation. St000145The Dyson rank of a partition. St000284The Plancherel distribution on integer partitions. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000618The number of self-evacuating tableaux of given shape. St000681The Grundy value of Chomp on Ferrers diagrams. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000934The 2-degree of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000654The first descent of a permutation. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001686The order of promotion on a Gelfand-Tsetlin pattern. St001060The distinguishing index of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000770The major index of an integer partition when read from bottom to top. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001903The number of fixed points of a parking function. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000264The girth of a graph, which is not a tree. St000732The number of double deficiencies of a permutation. St000989The number of final rises of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001948The number of augmented double ascents of a permutation. St001875The number of simple modules with projective dimension at most 1. St000454The largest eigenvalue of a graph if it is integral.
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!