- FindStat

Your data matches 106 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000155

Mapping

Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St000155: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1,1,0,0]
 => [2,1] => [2,1] => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [2,3,1] => [3,2,1] => 1
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [3,2,1] => [2,3,1] => 2
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,2,3,1] => 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [3,2,4,1] => 2
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [2,4,3,1] => 2
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [2,3,4,1] => 3
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [3,4,1,2] => 2
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,2,3,4,1] => 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [4,2,3,5,1] => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [3,2,5,4,1] => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [3,2,4,5,1] => 3
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [4,2,5,1,3] => 2
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [3,2,4,5,1] => [2,5,3,4,1] => 2
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [3,2,5,4,1] => [2,4,3,5,1] => 3
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,2,3,5,1] => [2,3,5,4,1] => 3
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [5,2,3,4,1] => [2,3,4,5,1] => 4
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [5,2,4,3,1] => [2,4,5,1,3] => 3
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [4,3,2,5,1] => [3,5,1,4,2] => 2
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [5,3,2,4,1] => [3,4,1,5,2] => 3
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [5,3,4,2,1] => [3,5,4,1,2] => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [5,4,3,2,1] => [3,4,5,1,2] => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,6,1] => [6,2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [2,3,4,6,5,1] => [5,2,3,4,6,1] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [2,3,5,4,6,1] => [4,2,3,6,5,1] => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [2,3,6,4,5,1] => [4,2,3,5,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]
 => [2,3,6,5,4,1] => [5,2,3,6,1,4] => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [2,4,3,5,6,1] => [3,2,6,4,5,1] => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => [2,4,3,6,5,1] => [3,2,5,4,6,1] => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => [2,5,3,4,6,1] => [3,2,4,6,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]
 => [2,6,3,4,5,1] => [3,2,4,5,6,1] => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [2,6,3,5,4,1] => [3,2,5,6,1,4] => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [2,5,4,3,6,1] => [4,2,6,1,5,3] => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [2,6,4,3,5,1] => [4,2,5,1,6,3] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [2,6,4,5,3,1] => [4,2,6,5,1,3] => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [2,6,5,4,3,1] => [4,2,5,6,1,3] => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [3,2,4,5,6,1] => [2,6,3,4,5,1] => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,0,1,0,1,1,0,0,0]
 => [3,2,4,6,5,1] => [2,5,3,4,6,1] => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [3,2,5,4,6,1] => [2,4,3,6,5,1] => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [3,2,6,4,5,1] => [2,4,3,5,6,1] => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => [3,2,6,5,4,1] => [2,5,3,6,1,4] => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [4,2,3,5,6,1] => [2,3,6,4,5,1] => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [4,2,3,6,5,1] => [2,3,5,4,6,1] => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [5,2,3,4,6,1] => [2,3,4,6,5,1] => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [6,2,3,4,5,1] => [2,3,4,5,6,1] => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [6,2,3,5,4,1] => [2,3,5,6,1,4] => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [5,2,4,3,6,1] => [2,4,6,1,5,3] => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => [6,2,4,3,5,1] => [2,4,5,1,6,3] => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [6,2,4,5,3,1] => [2,4,6,5,1,3] => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [6,2,5,4,3,1] => [2,4,5,6,1,3] => 4

Description

The number of exceedances (also excedences) of a permutation. This is defined as

$exc(\sigma) = \#\{ i : \sigma(i) > i \}$ . It is known that the number of exceedances is equidistributed with the number of descents, and that the bistatistic

$(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here,

$den$ is the Denert index of a permutation, see [[St000156]].

Matching statistic: St001508
(load all 2 compositions to match this statistic)

Mapping

St001508: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => 0 = 1 - 1
[1,0,1,0]
 => 0 = 1 - 1
[1,1,0,0]
 => 1 = 2 - 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]
 => 2 = 3 - 1
[1,1,1,0,0,0]
 => 1 = 2 - 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]
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => 1 = 2 - 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]
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0]
 => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
 => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
 => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
 => 2 = 3 - 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]
 => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
 => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => 2 = 3 - 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]
 => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
 => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
 => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
 => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
 => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
 => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
 => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
 => 3 = 4 - 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]
 => 3 = 4 - 1
[1,1,0,1,1,1,0,0,0,0]
 => 3 = 4 - 1
[]
 => ? = 0 - 1

Description

The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. Given two lattice paths

$U,L$ from

$(0,0)$ to

$(d,n-d)$ , [1] describes a bijection between lattice paths weakly between

$U$ and

$L$ and subsets of

$\{1,\dots,n\}$ such that the set of all such subsets gives the standard complex of the lattice path matroid

$M[U,L]$ . This statistic gives the cardinality of the image of this bijection when a Dyck path is considered as a path weakly above the diagonal and relative to the diagonal boundary.

Matching statistic: St001489
(load all 7 compositions to match this statistic)

Mapping

Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St001489: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1] => [1] => 0 = 1 - 1
[1,0,1,0]
 => [1,2] => [1,2] => 0 = 1 - 1
[1,1,0,0]
 => [2,1] => [2,1] => 1 = 2 - 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] => [1,3,2] => 1 = 2 - 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] => [3,2,1] => 2 = 3 - 1
[1,1,1,0,0,0]
 => [3,2,1] => [2,3,1] => 1 = 2 - 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] => [1,2,4,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2,4] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,4,3,2] => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [1,3,4,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,1,4,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [3,2,1,4] => 2 = 3 - 1
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,3,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [3,4,2,1] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [2,3,1,4] => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [2,4,3,1] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
 => [3,4,2,1] => [4,2,3,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [3,2,4,1] => 2 = 3 - 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] => [1,2,3,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3,5] => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,5,4,3] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [1,2,4,5,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,5,4] => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,4,3,2,5] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,5,4,3,2] => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [1,4,5,3,2] => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [1,3,4,2,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [1,3,5,4,2] => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,3,2] => [1,5,3,4,2] => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [1,4,3,5,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,1,3,5,4] => 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3,5] => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,5,4,3] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [2,1,4,5,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [3,2,1,4,5] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [3,2,1,5,4] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [4,3,2,1,5] => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [4,5,3,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [3,4,2,1,5] => 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [3,5,4,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,3,1] => [5,3,4,2,1] => 3 = 4 - 1
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [4,3,5,2,1] => 3 = 4 - 1
[]
 => [] => [] => ? = 0 - 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: St000213

Mapping

Mp00228: Dyck paths —reflect parallelogram polyomino⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
St000213: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1] => [1] => 1
[1,0,1,0]
 => [1,1,0,0]
 => [2,1] => [2,1] => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,2] => [1,2] => 2
[1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => [2,3,1] => [3,1,2] => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [2,1,3] => [2,1,3] => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,3,2] => [1,3,2] => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,2,3] => [1,2,3] => 3
[1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => [3,2,1] => [2,3,1] => 2
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,1,2,3] => 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [3,1,2,4] => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [2,1,3,4] => 3
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [3,4,1,2] => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,4,2,3] => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2,4] => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [1,2,4,3] => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [1,3,4,2] => 3
[1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [2,4,1,3] => 2
[1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [2,3,1,4] => 3
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [3,2,4,1] => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [2,3,4,1] => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,1,2,3,4] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [4,1,2,3,5] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [3,1,2,5,4] => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [3,1,2,4,5] => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [4,5,1,2,3] => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,5,3,4] => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3,5] => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [2,1,3,5,4] => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [2,1,3,4,5] => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [2,1,4,5,3] => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [3,5,1,2,4] => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [3,4,1,2,5] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [4,3,5,1,2] => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [3,4,5,1,2] => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,5,2,3,4] => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,4,2,3,5] => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,5,4] => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4,5] => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [1,4,5,2,3] => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,5,3,4] => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [1,2,4,5,3] => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [1,3,5,2,4] => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [1,3,4,2,5] => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [1,4,3,5,2] => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [1,3,4,5,2] => 4
[]
 => ?
 => ? => ? => ? = 0

Description

The number of weak exceedances (also weak excedences) of a permutation. This is defined as

$\operatorname{wex}(\sigma)=\#\{i:\sigma(i) \geq i\}.$ The number of weak exceedances is given by the number of exceedances (see [[St000155]]) plus the number of fixed points (see [[St000022]]) of

$\sigma$ .

Matching statistic: St000443

Mapping

Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000443: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 3
[1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[]
 => []
 => []
 => []
 => ? = 0

Description

The number of long tunnels of a Dyck path. A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.

Matching statistic: St001007

Mapping

Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 3
[1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[]
 => []
 => []
 => []
 => ? = 0

Description

Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.

Matching statistic: St001088

Mapping

Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001088: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 3
[1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[]
 => []
 => []
 => []
 => ? = 0

Description

Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra.

Matching statistic: St001187

Mapping

Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001187: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 3
[1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[]
 => []
 => []
 => []
 => ? = 0

Description

The number of simple modules with grade at least one in the corresponding Nakayama algebra.

Matching statistic: St001224

Mapping

Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001224: Dyck paths ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [1,0,1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 3
[1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 2
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,1,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 5
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,1,0,0,1,1,1,0,0,0]
 => 4
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
[]
 => []
 => []
 => []
 => ? = 0

Description

Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. Then the statistic gives the vector space dimension of the first Ext-group between X and the regular module.

Matching statistic: St000362

Mapping

Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000362: Graphs ⟶ ℤResult quality: 83% ●values known / values provided: 98%●distinct values known / distinct values provided: 83%

Values

[1,0]
 => [1] => [1] => ([],1)
 => 0 = 1 - 1
[1,0,1,0]
 => [1,2] => [1,2] => ([],2)
 => 0 = 1 - 1
[1,1,0,0]
 => [2,1] => [2,1] => ([(0,1)],2)
 => 1 = 2 - 1
[1,0,1,0,1,0]
 => [1,2,3] => [1,2,3] => ([],3)
 => 0 = 1 - 1
[1,0,1,1,0,0]
 => [1,3,2] => [1,3,2] => ([(1,2)],3)
 => 1 = 2 - 1
[1,1,0,0,1,0]
 => [2,1,3] => [2,1,3] => ([(1,2)],3)
 => 1 = 2 - 1
[1,1,0,1,0,0]
 => [2,3,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
[1,1,1,0,0,0]
 => [3,2,1] => [2,3,1] => ([(0,2),(1,2)],3)
 => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [1,2,3,4] => ([],4)
 => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [1,2,4,3] => ([(2,3)],4)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2,4] => ([(2,3)],4)
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [2,1,3,4] => ([(2,3)],4)
 => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [2,1,4,3] => ([(0,3),(1,2)],4)
 => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [2,3,1,4] => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
 => [3,4,2,1] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [1,2,3,4,5] => ([],5)
 => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [1,2,3,5,4] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3,5] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4,5] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,5,4] => ([(1,4),(2,3)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [1,4,5,3,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [1,3,4,2,5] => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [1,3,5,4,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,3,2] => [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [2,1,3,4,5] => ([(3,4)],5)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [2,1,3,5,4] => ([(1,4),(2,3)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3,5] => ([(1,4),(2,3)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [3,4,2,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,3,1] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[]
 => [] => [] => ([],0)
 => ? = 0 - 1

Description

The size of a minimal vertex cover of a graph. A '''vertex cover''' of a graph

$G$ is a subset

$S$ of the vertices of

$G$ such that each edge of

$G$ contains at least one vertex of

$S$ . Finding a minimal vertex cover is an NP-hard optimization problem.

The following 96 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St001176The size of a partition minus its first part. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001812The biclique partition number of a graph. St000829The Ulam distance of a permutation to the identity permutation. St001480The number of simple summands of the module J^2/J^3. St001864The number of excedances of a signed permutation. St001896The number of right descents of a signed permutations. St001820The size of the image of the pop stack sorting operator. St000528The height of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000080The rank of the poset. St001782The order of rowmotion on the set of order ideals of a poset. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001905The number of preferred parking spots in a parking function less than the index of the car. St001946The number of descents in a parking function. St001877Number of indecomposable injective modules with projective dimension 2. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001115The number of even descents of a permutation. St001060The distinguishing index of a graph. St001394The genus of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000035The number of left outer peaks of a permutation. St000871The number of very big ascents of a permutation. St000662The staircase size of the code of a permutation. St000022The number of fixed points of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length

$3$ . St000451The length of the longest pattern of the form k 1 2. St001153The number of blocks with even minimum in a set partition. 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$ . St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St000317The cycle descent number of a permutation. 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. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000239The number of small weak excedances. St000308The height of the tree associated to a permutation. St000354The number of recoils of a permutation. St000502The number of successions of a set partitions. St000864The number of circled entries of the shifted recording tableau of a permutation. 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. St001114The number of odd descents of a permutation. St001151The number of blocks with odd minimum. St001192The maximal dimension of

$Ext_A^2(S,A)$ for a simple module

$S$ over the corresponding Nakayama algebra

$A$ . St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001632The number of indecomposable injective modules

$I$ with

$dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001737The number of descents of type 2 in a permutation. St000023The number of inner peaks of a permutation. St000091The descent variation of a composition. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000353The number of inner valleys of a permutation. St000360The number of occurrences of the pattern 32-1. St000485The length of the longest cycle 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. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000836The number of descents of distance 2 of a permutation. St000872The number of very big descents of a permutation. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St001665The number of pure excedances 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. St001801Half the number of preimage-image pairs of different parity in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001871The number of triconnected components of a graph. St001644The dimension of a graph. St001330The hat guessing number of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset.