searching the database
Your data matches 357 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: St000011
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
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: St000013
(load all 33 compositions to match this statistic)
(load all 33 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
The height of a Dyck path.
The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000684
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000684: 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,0,1,0,1,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 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,0,1,0,1,0,0,1,0,1,0]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 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,0,1,1,0,1,0,0,0,1,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 3
Description
The global dimension of the LNakayama algebra associated to a Dyck path.
An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$.
The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$.
One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0].
Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$.
Examples:
* For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192.
* For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St001203
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St001203: 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,0,1,0,1,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,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,0,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,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,0,0,0,1,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,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,0,1,0,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,0,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,0,1,1,0,0,0,1,0,1,0]
=> 4
[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,0,1,0,0,1,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 3
Description
We 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:
In the list $L$ delete the first entry $c_0$ and substract from all other entries $n-1$ and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra.
Example:
[5,6,6,6,6] goes into [2,2,2,2,1].
Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra.
The statistic return the global dimension of the CNakayama algebra divided by 2.
Matching statistic: St000007
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [2,1] => 2 = 3 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,2] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 2 = 3 - 1
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Matching statistic: St000025
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 3 - 1
Description
The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of $D$.
Matching statistic: St000031
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000031: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000031: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 2 = 3 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [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,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => 2 = 3 - 1
Description
The number of cycles in the cycle decomposition of a permutation.
Matching statistic: St000153
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000153: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000153: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 2 = 3 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [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,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 3 = 4 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 2 = 3 - 1
Description
The number of adjacent cycles of a permutation.
This is the number of cycles of the permutation of the form (i,i+1,i+2,...i+k) which includes the fixed points (i).
Matching statistic: St001505
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001505: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001505: 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]
=> 3 = 2 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 6 = 5 + 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,0,1,0,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 5 = 4 + 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,0,1,1,0,0,1,0,1,0,0]
=> 5 = 4 + 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,0,1,1,1,0,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 6 = 5 + 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,0,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 5 = 4 + 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,0,1,0,1,0,1,0,1,0,0]
=> 5 = 4 + 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,0,1,0,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 5 = 4 + 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]
=> 5 = 4 + 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,0,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 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,1,1,0,1,0,0,0,0]
=> 4 = 3 + 1
Description
The number of elements generated by the Dyck path as a map in the full transformation monoid.
We view the resolution quiver of a Dyck path (corresponding to an LNakayamaalgebra) as a transformation and associate to it the submonoid generated by this map in the full transformation monoid.
Matching statistic: St001506
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St001506: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St001506: 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]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 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,0,0,1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3 = 4 - 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,0,0,1,1,0,1,0,0,1,0]
=> 3 = 4 - 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,0,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 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,0,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 3 = 4 - 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,0,1,0,1,0,1,0,0,1,0]
=> 3 = 4 - 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,0,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 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,0,1,0,0,1,0]
=> 3 = 4 - 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,0,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 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,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
Description
Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra.
The following 347 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000203The number of external nodes of a binary tree. St000528The height of a poset. St000686The finitistic dominant dimension of a Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001343The dimension of the reduced incidence algebra of a poset. St001717The largest size of an interval in a poset. St001809The index of the step at the first peak of maximal height in a Dyck path. St000010The length of the partition. St000024The number of double up and double down steps of a Dyck path. St000053The number of valleys of the Dyck path. St000069The number of maximal elements of a poset. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000439The position of the first down step of a Dyck path. St000507The number of ascents of a standard tableau. St000676The number of odd rises of a Dyck path. St000846The maximal number of elements covering an element of a poset. St000969We 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}$. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000306The bounce count of a Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000015The number of peaks of a Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St000080The rank of the poset. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000094The depth of an ordered tree. St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St000062The length of the longest increasing subsequence of the permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000166The depth minus 1 of an ordered tree. St000167The number of leaves of an ordered tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000291The number of descents of a binary word. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000390The number of runs of ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000527The width of the poset. St000542The number of left-to-right-minima of a permutation. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000843The decomposition number of a perfect matching. St000912The number of maximal antichains in a poset. St000991The number of right-to-left minima of a permutation. St001058The breadth of the ordered tree. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. 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. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000012The area of a Dyck path. St000019The cardinality of the support of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000141The maximum drop size of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000224The sorting index of a permutation. St000234The number of global ascents of a permutation. St000292The number of ascents of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001489The maximum of the number of descents and the number of inverse descents. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St000444The length of the maximal rise of a Dyck path. St000521The number of distinct subtrees of an ordered tree. St000675The number of centered multitunnels of a Dyck path. St000738The first entry in the last row of a standard tableau. St000883The number of longest increasing subsequences of a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000035The number of left outer peaks of a permutation. St000054The first entry of the permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000068The number of minimal elements in a poset. St000172The Grundy number of a graph. St000237The number of small exceedances. St000240The number of indices that are not small excedances. St000273The domination number of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000288The number of ones in a binary word. St000297The number of leading ones in a binary word. St000335The difference of lower and upper interactions. St000374The number of exclusive right-to-left minima of a permutation. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000389The number of runs of ones of odd length in a binary word. St000392The length of the longest run of ones in a binary word. St000544The cop number of a graph. St000553The number of blocks of a graph. St000678The number of up steps after the last double rise of a Dyck path. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000722The number of different neighbourhoods in a graph. St000740The last entry of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000874The position of the last double rise in a Dyck path. St000877The depth of the binary word interpreted as a path. St000908The length of the shortest maximal antichain in a poset. St000916The packing number of a graph. St000925The number of topologically connected components of a set partition. St000971The smallest closer of a set partition. St000982The length of the longest constant subword. St000996The number of exclusive left-to-right maxima of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001050The number of terminal closers of a set partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-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. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001372The length of a longest cyclic run of ones of a binary word. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001389The number of partitions of the same length below the given integer partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001462The number of factors of a standard tableaux under concatenation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001494The Alon-Tarsi number of a graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001670The connected partition number of a graph. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001733The number of weak left to right maxima of a Dyck path. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001963The tree-depth of a graph. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000021The number of descents of a permutation. St000041The number of nestings of a perfect matching. St000057The Shynar inversion number of a standard tableau. St000067The inversion number of the alternating sign matrix. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000120The number of left tunnels of a Dyck path. St000161The sum of the sizes of the right subtrees of a binary tree. St000168The number of internal nodes of an ordered tree. St000211The rank of the set partition. St000214The number of adjacencies of a permutation. St000238The number of indices that are not small weak excedances. St000245The number of ascents of a permutation. St000247The number of singleton blocks of a set partition. St000272The treewidth of a graph. St000305The inverse major index of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000332The positive inversions of an alternating sign matrix. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000362The size of a minimal vertex cover of a graph. St000446The disorder of a permutation. St000497The lcb statistic of a set partition. St000536The pathwidth of a graph. St000572The dimension exponent of a set partition. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000632The jump number of the poset. St000672The number of minimal elements in Bruhat order not less than the permutation. St000834The number of right outer peaks of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St000871The number of very big ascents of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001083The number of boxed occurrences of 132 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. 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. St001270The bandwidth of a graph. St001274The number of indecomposable injective modules with projective dimension equal to two. St001277The degeneracy of a graph. St001298The number of repeated entries in the Lehmer code of a permutation. St001358The largest degree of a regular subgraph of a graph. St001397Number of pairs of incomparable elements in a finite poset. St001427The number of descents of a signed permutation. St001428The number of B-inversions of a signed permutation. St001479The number of bridges of a graph. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001777The number of weak descents in an integer composition. St001869The maximum cut size of a graph. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001962The proper pathwidth of a graph. St000643The size of the largest orbit of antichains under Panyushev complementation. St000061The number of nodes on the left branch of a binary tree. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000083The number of left oriented leafs of a binary tree except the first one. St000216The absolute length of a permutation. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000809The reduced reflection length of the permutation. St000957The number of Bruhat lower covers of a permutation. St000984The number of boxes below precisely one peak. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001480The number of simple summands of the module J^2/J^3. St000485The length of the longest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000654The first descent of a permutation. St000668The least common multiple of the parts of the partition. St000702The number of weak deficiencies of a permutation. St000708The product of the parts of an integer partition. St000914The sum of the values of the Möbius function of a poset. St000990The first ascent of a permutation. St001062The maximal size of a block of a set partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000502The number of successions of a set partitions. St000539The number of odd inversions of a permutation. St000653The last descent of a permutation. St000728The dimension of a set partition. St000730The maximal arc length of a set partition. St000794The mak of a permutation. St000795The mad of a permutation. St000797The stat`` of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000833The comajor index of a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St000989The number of final rises of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001812The biclique partition number of a graph. St000619The number of cyclic descents of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001432The order dimension of the partition. St001644The dimension of a graph. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St000058The order of a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000711The number of big exceedences of a permutation. St000662The staircase size of the code of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000924The number of topologically connected components of a perfect matching. St000451The length of the longest pattern of the form k 1 2. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001330The hat guessing number of a graph. St000236The number of cyclical small weak excedances. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001671Haglund's hag of a permutation. St001589The nesting number of a perfect matching. St000732The number of double deficiencies of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000673The number of non-fixed points of a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St000181The number of connected components of the Hasse diagram for the poset. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001077The prefix exchange distance of a permutation. St001590The crossing number of a perfect matching. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000710The number of big deficiencies of a permutation. St001152The number of pairs with even minimum in a perfect matching. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001668The number of points of the poset minus the width of the poset. St000454The largest eigenvalue of a graph if it is integral. St001863The number of weak excedances of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001769The reflection length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St001720The minimal length of a chain of small intervals in a lattice. St000455The second largest eigenvalue of a graph if it is integral. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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$. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000317The cycle descent number of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001896The number of right descents of a signed permutations. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001712The number of natural descents of a standard Young tableau. St000670The reversal length of a permutation. St000942The number of critical left to right maxima of the parking functions. St000983The length of the longest alternating subword. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001821The sorting index of a signed permutation. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001624The breadth of a lattice. St000884The number of isolated descents of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001877Number of indecomposable injective modules with projective dimension 2. 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$. St000028The number of stack-sorts needed to sort a permutation. St000352The Elizalde-Pak rank of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing.
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!