searching the database
Your data matches 839 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: St001063
(load all 56 compositions to match this statistic)
(load all 56 compositions to match this statistic)
St001063: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> 1 = 2 - 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]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> 2 = 3 - 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]
=> 1 = 2 - 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]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 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]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra.
Matching statistic: St000121
(load all 78 compositions to match this statistic)
(load all 78 compositions to match this statistic)
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000121: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000121: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> 0 = 2 - 2
[1,0,1,0]
=> [[.,.],.]
=> 0 = 2 - 2
[1,1,0,0]
=> [.,[.,.]]
=> 0 = 2 - 2
[1,0,1,0,1,0]
=> [[[.,.],.],.]
=> 0 = 2 - 2
[1,0,1,1,0,0]
=> [[.,.],[.,.]]
=> 0 = 2 - 2
[1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 0 = 2 - 2
[1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 0 = 2 - 2
[1,1,1,0,0,0]
=> [.,[.,[.,.]]]
=> 0 = 2 - 2
[1,0,1,0,1,0,1,0]
=> [[[[.,.],.],.],.]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,0]
=> [[[.,.],.],[.,.]]
=> 0 = 2 - 2
[1,0,1,1,0,0,1,0]
=> [[[.,.],[.,.]],.]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,0]
=> [[.,.],[.,[.,.]]]
=> 0 = 2 - 2
[1,1,0,0,1,0,1,0]
=> [[[.,[.,.]],.],.]
=> 0 = 2 - 2
[1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 0 = 2 - 2
[1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,0]
=> [.,[[.,.],[.,.]]]
=> 0 = 2 - 2
[1,1,1,0,0,0,1,0]
=> [[.,[.,[.,.]]],.]
=> 0 = 2 - 2
[1,1,1,0,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> 0 = 2 - 2
[1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 0 = 2 - 2
[1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 1 = 3 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[[[[.,.],.],.],.],.]
=> 0 = 2 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [[[[.,.],.],.],[.,.]]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[[[.,.],.],[.,.]],.]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> 0 = 2 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [[[.,.],.],[.,[.,.]]]
=> 0 = 2 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[[[.,.],[.,.]],.],.]
=> 0 = 2 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[[.,.],[[.,.],.]],.]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> 0 = 2 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [[.,.],[[.,.],[.,.]]]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 0 = 2 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> 0 = 2 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 1 = 3 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[[[.,[.,.]],.],.],.]
=> 0 = 2 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 0 = 2 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 0 = 2 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 0 = 2 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [[.,[.,.]],[.,[.,.]]]
=> 0 = 2 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 0 = 2 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[[[.,.],.],.]],.]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 0 = 2 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [.,[[[.,.],.],[.,.]]]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],[.,.]]],.]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> 0 = 2 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> 0 = 2 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 1 = 3 - 2
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,[.,.]]]]}}} in a binary tree.
[[oeis:A036765]] counts binary trees avoiding this pattern.
Matching statistic: St001292
(load all 42 compositions to match this statistic)
(load all 42 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001292: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001292: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 0 = 2 - 2
[1,0,1,0]
=> [1,0,1,0]
=> 0 = 2 - 2
[1,1,0,0]
=> [1,1,0,0]
=> 0 = 2 - 2
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 2 - 2
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 2 - 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 2 - 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 4 - 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
Description
The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path.
Here $A$ is the Nakayama algebra associated to a Dyck path as given in [[DyckPaths/NakayamaAlgebras]].
Matching statistic: St001226
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001226: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001226: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 2
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,1,0,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,0,1,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[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,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
Description
The 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.
That is the number of i such that $Ext_A^1(J,e_i J)=0$.
Matching statistic: St001784
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00151: Permutations —to cycle type⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => {{1,2}}
=> 2
[1,0,1,0]
=> [3,1,2] => {{1,2,3}}
=> 2
[1,1,0,0]
=> [2,3,1] => {{1,2,3}}
=> 2
[1,0,1,0,1,0]
=> [4,1,2,3] => {{1,2,3,4}}
=> 2
[1,0,1,1,0,0]
=> [3,1,4,2] => {{1,2,3,4}}
=> 2
[1,1,0,0,1,0]
=> [2,4,1,3] => {{1,2,3,4}}
=> 2
[1,1,0,1,0,0]
=> [4,3,1,2] => {{1,2,3,4}}
=> 2
[1,1,1,0,0,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> 2
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => {{1,2,3,4,5}}
=> 2
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => {{1,2,3,4,5}}
=> 2
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => {{1,2,3,4,5}}
=> 2
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => {{1,2,3,4,5}}
=> 2
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => {{1,2,3,4,5}}
=> 2
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => {{1,2,3,4,5}}
=> 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => {{1,2,3,4,5}}
=> 2
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => {{1,2,3,4,5}}
=> 2
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => {{1,3,5},{2,4}}
=> 3
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => {{1,2,3,4,5}}
=> 2
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => {{1,2,3,4,5}}
=> 2
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => {{1,2,3,4,5}}
=> 2
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => {{1,2,3,4,5}}
=> 2
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => {{1,2,4,6},{3,5}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => {{1,2,3,4,5,6}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => {{1,3,5,6},{2,4}}
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => {{1,3,5},{2,4,6}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => {{1,3,5,6},{2,4}}
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => {{1,2,3,4,5,6}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => {{1,3,6},{2,4,5}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => {{1,2,3,4,5,6}}
=> 2
Description
The minimum of the smallest closer and the second element of the block containing 1 in a set partition.
A closer of a set partition is the maximal element of a non-singleton block. This statistic is defined as $1$ if $\{1\}$ is a singleton block, and otherwise the minimum of the smallest closer and the second element of the block containing $1$.
Matching statistic: St000013
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000013: 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,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,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,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,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: St000335
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000335: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000335: 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,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,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,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
The difference of lower and upper interactions.
An ''upper interaction'' in a Dyck path is the occurrence of a factor $0^k 1^k$ with $k \geq 1$ (see [[St000331]]), and a ''lower interaction'' is the occurrence of a factor $1^k 0^k$ with $k \geq 1$. In both cases, $1$ denotes an up-step $0$ denotes a a down-step.
Matching statistic: St000443
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000443: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000443: 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,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,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,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
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
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001007: 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,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,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,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001014
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001014: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001014: 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,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 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,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,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,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
Description
Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path.
The following 829 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St000024The number of double up and double down steps of a Dyck path. St000223The number of nestings in the permutation. St000359The number of occurrences of the pattern 23-1. St000360The number of occurrences of the pattern 32-1. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000408The number of occurrences of the pattern 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001172The number of 1-rises at odd height of a Dyck path. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001549The number of restricted non-inversions between exceedances. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000439The position of the first down step of a Dyck path. 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}$. St000971The smallest closer of a set partition. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. 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. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000160The multiplicity of the smallest part of a partition. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000234The number of global ascents of a permutation. St000346The number of coarsenings of a partition. St000570The Edelman-Greene number of a permutation. St000655The length of the minimal rise of a Dyck path. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000816The number of standard composition tableaux of the composition. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000883The number of longest increasing subsequences of a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000990The first ascent of a permutation. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. 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. St001162The minimum jump of a permutation. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001530The depth of a Dyck path. St001571The Cartan determinant of the integer partition. St001732The number of peaks visible from the left. St001733The number of weak left to right maxima of a Dyck path. St001737The number of descents of type 2 in a permutation. St001809The index of the step at the first peak of maximal height in a Dyck path. St001831The multiplicity of the non-nesting perfect matching in the chord expansion of a perfect matching. St001933The largest multiplicity of a part in an integer partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000053The number of valleys of the Dyck path. St000091The descent variation of a composition. St000119The number of occurrences of the pattern 321 in a permutation. St000120The number of left tunnels of a Dyck path. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000126The number of occurrences of the contiguous pattern [.,[.,[.,[.,[.,.]]]]] in a binary tree. St000133The "bounce" of a permutation. St000214The number of adjacencies of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000232The number of crossings of a set partition. St000233The number of nestings of a set partition. St000237The number of small exceedances. St000306The bounce count of a Dyck path. St000317The cycle descent number of a permutation. St000331The number of upper interactions of a Dyck path. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000447The number of pairs of vertices of a graph with distance 3. St000498The lcs statistic of a set partition. St000516The number of stretching pairs of a permutation. St000562The number of internal points of a set partition. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000648The number of 2-excedences of a permutation. St000664The number of right ropes of a permutation. St000674The number of hills of a Dyck path. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000731The number of double exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000871The number of very big ascents of a permutation. St000962The 3-shifted major index of a permutation. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000989The number of final rises of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. 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. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001130The number of two successive successions in a permutation. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. 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. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001301The first Betti number of the order complex associated with the poset. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001394The genus of a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001578The minimal number of edges to add or remove to make a graph a line graph. St001584The area statistic between a Dyck path and its bounce path. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001689The number of celebrities in a graph. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001727The number of invisible inversions of a permutation. St001728The number of invisible descents of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001866The nesting alignments of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000444The length of the maximal rise of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001959The product of the heights of the peaks of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000565The major index of a set partition. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001480The number of simple summands of the module J^2/J^3. St001520The number of strict 3-descents. St000031The number of cycles in the cycle decomposition of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001500The global dimension of magnitude 1 Nakayama algebras. St000219The number of occurrences of the pattern 231 in a permutation. St000376The bounce deficit of a Dyck path. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000538The number of even inversions of a permutation. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000649The number of 3-excedences of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000836The number of descents of distance 2 of a permutation. St000874The position of the last double rise in a Dyck path. St000921The number of internal inversions of a binary word. St000931The number of occurrences of the pattern UUU in a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000947The major index east count of a Dyck path. St000963The 2-shifted major index of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001082The number of boxed occurrences of 123 in a permutation. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001811The Castelnuovo-Mumford regularity of a permutation. St001948The number of augmented double ascents of a permutation. St001271The competition number of a graph. St000630The length of the shortest palindromic decomposition of a binary word. 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$. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000627The exponent of a binary word. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000629The defect of a binary word. St001095The number of non-isomorphic posets with precisely one further covering relation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000733The row containing the largest entry of a standard tableau. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000768The number of peaks in an integer composition. St000842The breadth of a permutation. St000069The number of maximal elements of a poset. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001471The magnitude of a Dyck path. St000181The number of connected components of the Hasse diagram for the poset. St001490The number of connected components of a skew partition. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001720The minimal length of a chain of small intervals in a lattice. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St001890The maximum magnitude of the Möbius function of a poset. St001846The number of elements which do not have a complement in the lattice. St001964The interval resolution global dimension of a poset. St000259The diameter of a connected graph. 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$. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001396Number of triples of incomparable elements in a finite poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001568The smallest positive integer that does not appear twice in the partition. St000534The number of 2-rises of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St000260The radius of a connected graph. St000068The number of minimal elements in a poset. St000666The number of right tethers of a permutation. St001621The number of atoms of a lattice. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001862The number of crossings of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001344The neighbouring number of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000007The number of saliances of the permutation. St000035The number of left outer peaks of a permutation. St000669The number of permutations obtained by switching ascents or descents of size 2. St000884The number of isolated descents of a permutation. St000022The number of fixed points of a permutation. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001330The hat guessing number of a graph. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000527The width of the poset. St001399The distinguishing number of a poset. St000632The jump number of the poset. St000862The number of parts of the shifted shape of a permutation. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. 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. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St000215The number of adjacencies of a permutation, zero appended. St000850The number of 1/2-balanced pairs in a poset. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St000477The weight of a partition according to Alladi. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000997The even-odd crank of an integer partition. St000741The Colin de Verdière graph invariant. St000996The number of exclusive left-to-right maxima of a permutation. St000002The number of occurrences of the pattern 123 in a permutation. St000650The number of 3-rises of a permutation. St001875The number of simple modules with projective dimension at most 1. St000383The last part of an integer composition. St001867The number of alignments of type EN of a signed permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000805The number of peaks of the associated bargraph. St000900The minimal number of repetitions of a part in an integer composition. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001569The maximal modular displacement of a permutation. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001960The number of descents of a permutation minus one if its first entry is not one. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000983The length of the longest alternating subword. St001488The number of corners of a skew partition. St001545The second Elser number of a connected graph. St000292The number of ascents of a binary word. St000314The number of left-to-right-maxima of a permutation. St000390The number of runs of ones in a binary word. St000486The number of cycles of length at least 3 of a permutation. St000654The first descent of a permutation. St000779The tier of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000902 The minimal number of repetitions of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001313The number of Dyck paths above the lattice path given by a binary word. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001413Half the length of the longest even length palindromic prefix of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001665The number of pure excedances of a permutation. St001768The number of reduced words of a signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001884The number of borders of a binary word. St001889The size of the connectivity set of a signed permutation. St000291The number of descents of a binary word. St000338The number of pixed points of a permutation. St000348The non-inversion sum of a binary word. St000461The rix statistic of a permutation. St000488The number of cycles of a permutation of length at most 2. St000546The number of global descents of a permutation. St000661The number of rises of length 3 of a Dyck path. St000682The Grundy value of Welter's game on a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000709The number of occurrences of 14-2-3 or 14-3-2. St000877The depth of the binary word interpreted as a path. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001712The number of natural descents of a standard Young tableau. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001821The sorting index of a signed permutation. St001823The Stasinski-Voll length of a signed permutation. St001856The number of edges in the reduced word graph of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St000326The position of the first one in a binary word after appending a 1 at the end. St000729The minimal arc length of a set partition. St000889The number of alternating sign matrices with the same antidiagonal sums. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001487The number of inner corners of a skew partition. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000635The number of strictly order preserving maps of a poset into itself. St000352The Elizalde-Pak rank of a permutation. St001555The order of a signed permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001910The height of the middle non-run of a Dyck path. St000656The number of cuts of a poset. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St001060The distinguishing index of a graph. St000925The number of topologically connected components of a set partition. St000247The number of singleton blocks of a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000879The number of long braid edges in the graph of braid moves of a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St000451The length of the longest pattern of the form k 1 2. St000696The number of cycles in the breakpoint graph of a permutation. St001429The number of negative entries in a signed permutation. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000981The length of the longest zigzag subpath. St000455The second largest eigenvalue of a graph if it is integral. St000895The number of ones on the main diagonal of an alternating sign matrix. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001115The number of even descents of a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001434The number of negative sum pairs of a signed permutation. St001669The number of single rises in a Dyck path. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St000907The number of maximal antichains of minimal length in a poset. St000764The number of strong records in an integer composition. St000807The sum of the heights of the valleys of the associated bargraph. St000878The number of ones minus the number of zeros of a binary word. St001050The number of terminal closers of a set partition. St001616The number of neutral elements in a lattice. St001624The breadth of a lattice. St000141The maximum drop size of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000662The staircase size of the code of a permutation. St000703The number of deficiencies of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000115The single entry in the last row. St000124The cardinality of the preimage of the Simion-Schmidt map. St000245The number of ascents of a permutation. St000834The number of right outer peaks of a permutation. St000386The number of factors DDU in a Dyck path. St000449The number of pairs of vertices of a graph with distance 4. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000598The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, 3 is maximal, (2,3) are consecutive in a block. St000607The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 3 is maximal, (2,3) are consecutive in a block. St001625The Möbius invariant of a lattice. St001851The number of Hecke atoms of a signed permutation. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000422The energy of a graph, if it is integral. St000460The hook length of the last cell along the main diagonal of an integer partition. St000474Dyson's crank of a partition. St000667The greatest common divisor of the parts of the partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001527The cyclic permutation representation number of an integer partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St000028The number of stack-sorts needed to sort a permutation. St000454The largest eigenvalue of a graph if it is integral. St001427The number of descents of a signed permutation. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000065The number of entries equal to -1 in an alternating sign matrix. St001947The number of ties in a parking function. St000058The order of a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St000021The number of descents of a permutation. St000154The sum of the descent bottoms of a permutation. St000210Minimum over maximum difference of elements in cycles. St000253The crossing number of a set partition. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000694The number of affine bounded permutations that project to a given permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001461The number of topologically connected components of the chord diagram of a permutation. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001729The number of visible descents of a permutation. St001806The upper middle entry of a permutation. St001928The number of non-overlapping descents in a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000295The length of the border of a binary word. St000462The major index minus the number of excedences of a permutation. St000496The rcs statistic of a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000943The number of spots the most unlucky car had to go further in a parking function. St001371The length of the longest Yamanouchi prefix of a binary word. St001381The fertility of a permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001781The interlacing number of a set partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001857The number of edges in the reduced word graph of a signed permutation. St001903The number of fixed points of a parking function. St000061The number of nodes on the left branch of a binary tree. St000062The length of the longest increasing subsequence of the permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000308The height of the tree associated to a permutation. St000469The distinguishing number of a graph. St000489The number of cycles of a permutation of length at most 3. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000702The number of weak deficiencies of a permutation. St000740The last entry of a permutation. St000823The number of unsplittable factors of the set partition. St000839The largest opener of a set partition. St000873The aix statistic of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000917The open packing number of a graph. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000991The number of right-to-left minima of a permutation. St001029The size of the core of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001111The weak 2-dynamic chromatic number of a graph. St001119The length of a shortest maximal path in a graph. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001261The Castelnuovo-Mumford regularity of a graph. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001316The domatic number of a graph. St001433The flag major index of a signed permutation. St001494The Alon-Tarsi number of a graph. St001524The degree of symmetry of a binary word. St001580The acyclic chromatic number of a graph. St001716The 1-improper chromatic number of a graph. St001817The number of flag weak exceedances of a signed permutation. St001819The flag Denert index of a signed permutation. St001826The maximal number of leaves on a vertex of a graph. St001892The flag excedance statistic of a signed permutation. St001893The flag descent of a signed permutation. St000026The position of the first return of a Dyck path. St000037The sign of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000230Sum of the minimal elements of the blocks of a set partition. St000239The number of small weak excedances. St000254The nesting number of a set partition. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000272The treewidth of a graph. St000287The number of connected components of a graph. St000354The number of recoils of a permutation. St000363The number of minimal vertex covers of a graph. St000456The monochromatic index of a connected graph. St000472The sum of the ascent bottoms of a permutation. St000492The rob statistic of a set partition. St000501The size of the first part in the decomposition of a permutation. St000502The number of successions of a set partitions. St000529The number of permutations whose descent word is the given binary word. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000544The cop number of a graph. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000657The smallest part of an integer composition. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000756The sum of the positions of the left to right maxima of a permutation. St000763The sum of the positions of the strong records of an integer composition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000788The number of nesting-similar perfect matchings of a perfect matching. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000886The number of permutations with the same antidiagonal sums. St000893The number of distinct diagonal sums of an alternating sign matrix. St000942The number of critical left to right maxima of the parking functions. St000948The chromatic discriminant of a graph. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001081The number of minimal length factorizations of a permutation into star transpositions. St001108The 2-dynamic chromatic number of a graph. St001151The number of blocks with odd minimum. St001153The number of blocks with even minimum in a set partition. 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. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001260The permanent of an alternating sign matrix. St001267The length of the Lyndon factorization of the binary word. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001272The number of graphs with the same degree sequence. St001277The degeneracy of a graph. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001333The cardinality of a minimal edge-isolating set of a graph. St001358The largest degree of a regular subgraph of a graph. St001363The Euler characteristic of a graph according to Knill. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001437The flex of a binary word. St001463The number of distinct columns in the nullspace of a graph. St001468The smallest fixpoint of a permutation. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001518The number of graphs with the same ordinary spectrum as the given graph. St001546The number of monomials in the Tutte polynomial of a graph. St001590The crossing number of a perfect matching. St001592The maximal number of simple paths between any two different vertices of a graph. St001597The Frobenius rank of a skew partition. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001743The discrepancy of a graph. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001792The arboricity of a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001807The lower middle entry of a permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001850The number of Hecke atoms of a permutation. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001896The number of right descents of a signed permutations. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000077The number of boxed and circled entries. St000090The variation of a composition. St000095The number of triangles of a graph. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000241The number of cyclical small excedances. St000248The number of anti-singletons of a set partition. St000268The number of strongly connected orientations of a graph. St000274The number of perfect matchings of a graph. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000379The number of Hamiltonian cycles in a graph. St000403The Szeged index minus the Wiener index of a graph. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000552The number of cut vertices of a graph. St000637The length of the longest cycle in a graph. St000663The number of right floats of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000699The toughness times the least common multiple of 1,. St000761The number of ascents in an integer composition. St000787The number of flips required to make a perfect matching noncrossing. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000837The number of ascents of distance 2 of a permutation. St000872The number of very big descents of a permutation. St000894The trace of an alternating sign matrix. St000961The shifted major index of a permutation. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001073The number of nowhere zero 3-flows of a graph. St001114The number of odd descents of a permutation. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001131The number of trivial trees on the path to label one in the decreasing labelled binary unordered tree associated with the perfect matching. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001204Call 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001281The normalized isoperimetric number of a graph. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001377The major index minus the number of inversions of a permutation. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001510The number of self-evacuating linear extensions of a finite poset. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001535The number of cyclic alignments of a permutation. St001536The number of cyclic misalignments of a permutation. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St001596The number of two-by-two squares inside a skew partition. St001691The number of kings in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001736The total number of cycles in a graph. St001783The number of odd automorphisms of a graph. St001793The difference between the clique number and the chromatic number of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001797The number of overfull subgraphs of a graph. St001801Half the number of preimage-image pairs of different parity in a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001822The number of alignments of a signed permutation. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001871The number of triconnected components of a graph. St001927Sparre Andersen's number of positives of a signed permutation. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St000264The girth of a graph, which is not a tree. St000353The number of inner valleys of a permutation. St000911The number of maximal antichains of maximal size in a poset. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001926Sparre Andersen's position of the maximum of a signed permutation.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!