searching the database
Your data matches 351 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: St001066
(load all 35 compositions to match this statistic)
(load all 35 compositions to match this statistic)
St001066: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1
[1,0,1,0]
=> 1
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
The number of simple reflexive modules in the corresponding Nakayama algebra.
Matching statistic: St001483
(load all 20 compositions to match this statistic)
(load all 20 compositions to match this statistic)
St001483: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1
[1,0,1,0]
=> 1
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.
Matching statistic: St000118
(load all 21 compositions to match this statistic)
(load all 21 compositions to match this statistic)
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000118: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000118: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> 0 = 1 - 1
[1,0,1,0]
=> [[.,.],.]
=> 0 = 1 - 1
[1,1,0,0]
=> [.,[.,.]]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [[[.,.],.],.]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [[.,.],[.,.]]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [.,[.,[.,.]]]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [[[[.,.],.],.],.]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [[[.,.],.],[.,.]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [[[.,.],[.,.]],.]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [[.,.],[.,[.,.]]]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [[[.,[.,.]],.],.]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [.,[[.,.],[.,.]]]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [[.,[.,[.,.]]],.]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [[[[[.,.],.],.],.],.]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [[[[.,.],.],.],[.,.]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [[[[.,.],.],[.,.]],.]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [[[.,.],.],[.,[.,.]]]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [[[[.,.],[.,.]],.],.]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [[[.,.],[[.,.],.]],.]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [[.,.],[[.,.],[.,.]]]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [[[[.,[.,.]],.],.],.]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [[.,[.,.]],[.,[.,.]]]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[[[.,.],.],.]],.]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [.,[[[.,.],.],[.,.]]]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],[.,.]]],.]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 2 = 3 - 1
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,.]]]}}} in a binary tree.
[[oeis:A001006]] counts binary trees avoiding this pattern.
Matching statistic: St000931
(load all 35 compositions to match this statistic)
(load all 35 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000931: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000931: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The number of occurrences of the pattern UUU in a Dyck path.
The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Matching statistic: St001167
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001167: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001167: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [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,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [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] => [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,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
Description
The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra.
The top of a module is the cokernel of the inclusion of the radical of the module into the module.
For Nakayama algebras with at most 8 simple modules, the statistic also coincides with the number of simple modules with projective dimension at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001253
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001253: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001253: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [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,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [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] => [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,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
Description
The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra.
For the first 196 values the statistic coincides also with the number of fixed points of $\tau \Omega^2$ composed with its inverse, see theorem 5.8. in the reference for more details.
The number of Dyck paths of length n where the statistics returns zero seems to be 2^(n-1).
Matching statistic: St000776
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000776: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000776: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0]
=> [3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
Description
The maximal multiplicity of an eigenvalue in a graph.
Matching statistic: St000052
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [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,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Matching statistic: St001172
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001172: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001172: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [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,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
Description
The number of 1-rises at odd height of a Dyck path.
Matching statistic: St000496
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => {{1}}
=> 0 = 1 - 1
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => {{1},{2}}
=> 0 = 1 - 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => {{1,2}}
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => {{1},{2},{3}}
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => {{1},{2,3}}
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => {{1,2},{3}}
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => {{1},{2,3}}
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => {{1,3},{2}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => {{1,3},{2},{4}}
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ?
=> ? = 2 - 1
Description
The rcs statistic of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a '''rcs''' (right-closer-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a < b$.
The following 341 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001323The independence gap of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001781The interlacing number of a set partition. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001841The number of inversions of a set partition. St001843The Z-index of a set partition. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. 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. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. 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. St000356The number of occurrences of the pattern 13-2. St000463The number of admissible inversions of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St000470The number of runs in a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St000619The number of cyclic descents of a permutation. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St000354The number of recoils of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000795The mad of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000957The number of Bruhat lower covers of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St000445The number of rises of length 1 of a Dyck path. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St001389The number of partitions of the same length below the given integer partition. St000731The number of double exceedences of a permutation. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000538The number of even inversions of a permutation. St000937The number of positive values of the symmetric group character corresponding to the partition. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St001727The number of invisible inversions of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001411The number of patterns 321 or 3412 in a permutation. St000732The number of double deficiencies of a permutation. St000836The number of descents of distance 2 of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St001091The number of parts in an integer partition whose next smaller part has the same size. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000019The cardinality of the support of a permutation. St000214The number of adjacencies of a permutation. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001484The number of singletons of an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000932The number of occurrences of the pattern UDU in a Dyck path. St000015The number of peaks of a Dyck path. St000288The number of ones in a binary word. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000335The difference of lower and upper interactions. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000733The row containing the largest entry of a standard tableau. St000734The last entry in the first row of a standard tableau. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000982The length of the longest constant subword. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001165Number of simple modules with even projective dimension 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. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. 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:
St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001415The length of the longest palindromic prefix of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001471The magnitude of a Dyck path. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001530The depth of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000648The number of 2-excedences of a permutation. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St000617The number of global maxima of a Dyck path. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000675The number of centered multitunnels of a Dyck path. 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. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000744The length of the path to the largest entry in a standard Young tableau. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001280The number of parts of an integer partition that are at least two. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001432The order dimension of the partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001933The largest multiplicity of a part in an integer partition. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000475The number of parts equal to 1 in a partition. 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. St001571The Cartan determinant of the integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000474Dyson's crank of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000667The greatest common divisor of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000770The major index of an integer partition when read from bottom to top. 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. St001279The sum of the parts of an integer partition that are at least two. St001360The number of covering relations in Young's lattice below a partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001527The cyclic permutation representation number of an integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000359The number of occurrences of the pattern 23-1. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000119The number of occurrences of the pattern 321 in a permutation. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St000039The number of crossings of a permutation. St000317The cycle descent number of a permutation. St000325The width of the tree associated to a permutation. St000456The monochromatic index of a connected graph. St000021The number of descents of a permutation. St000030The sum of the descent differences of a permutations. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000238The number of indices that are not small weak excedances. St000242The number of indices that are not cyclical small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000355The number of occurrences of the pattern 21-3. St000837The number of ascents of distance 2 of a permutation. 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. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001082The number of boxed occurrences of 123 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. St001130The number of two successive successions in a permutation. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St000091The descent variation of a composition. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000781The number of proper colouring schemes of a Ferrers diagram. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001060The distinguishing index of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000647The number of big descents of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St000650The number of 3-rises of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000237The number of small exceedances. St000100The number of linear extensions of a poset. St000260The radius of a connected graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001597The Frobenius rank of a skew partition. St001330The hat guessing number of a graph. St000215The number of adjacencies of a permutation, zero appended. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001964The interval resolution global dimension of a poset. St001075The minimal size of a block of a set partition. St001778The largest greatest common divisor of an element and its image in a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000307The number of rowmotion orbits of a poset. St000534The number of 2-rises of a permutation. St000099The number of valleys of a permutation, including the boundary. St000314The number of left-to-right-maxima of a permutation. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001399The distinguishing number of a poset. St000485The length of the longest cycle of a permutation. St000028The number of stack-sorts needed to sort a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000654The first descent of a permutation. St001549The number of restricted non-inversions between exceedances. St000649The number of 3-excedences of a permutation. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000632The jump number of the poset. St000247The number of singleton blocks of a set partition. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St000022The number of fixed points of a permutation. St001624The breadth of a lattice. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001820The size of the image of the pop stack sorting operator. St001513The number of nested exceedences of a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St000441The number of successions of a permutation. St000451The length of the longest pattern of the form k 1 2. St000665The number of rafts of a permutation. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000527The width of the poset. St001811The Castelnuovo-Mumford regularity of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001884The number of borders of a binary word. St001118The acyclic chromatic index of a graph. St000908The length of the shortest maximal antichain in a poset. St001510The number of self-evacuating linear extensions of a finite poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001472The permanent of the Coxeter matrix of the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000524The number of posets with the same order polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000914The sum of the values of the Möbius function of a poset. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St000392The length of the longest run of ones in a binary word. St000181The number of connected components of the Hasse diagram for the poset. St001866The nesting alignments of a signed permutation. St001846The number of elements which do not have a complement in the lattice. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001720The minimal length of a chain of small intervals in a lattice. St000741The Colin de Verdière graph invariant. St001268The size of the largest ordinal summand in the poset. St001779The order of promotion on the set of linear extensions of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000058The order of a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St000983The length of the longest alternating subword. St001397Number of pairs of incomparable elements in a finite poset. St001738The minimal order of a graph which is not an induced subgraph of the given graph. 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. St000264The girth of a graph, which is not a tree. St001095The number of non-isomorphic posets with precisely one further covering relation. St001867The number of alignments of type EN of a signed permutation. St001052The length of the exterior of a permutation. St001403The number of vertical separators in a permutation. St001864The number of excedances of a signed permutation. St001487The number of inner corners of a skew partition. St000920The logarithmic height of a Dyck path. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001423The number of distinct cubes in a binary word. St001550The number of inversions between exceedances where the greater exceedance is linked. St001948The number of augmented double ascents of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000669The number of permutations obtained by switching ascents or descents of size 2. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001201The grade of the simple module $S_0$ in the special CNakayama 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. St001267The length of the Lyndon factorization of the binary word. St001273The projective dimension of the first term in an injective coresolution of the regular module. St000381The largest part of an integer composition. St000516The number of stretching pairs of a permutation. St000663The number of right floats of a permutation. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000884The number of isolated descents of a permutation. St000989The number of final rises of a permutation. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001394The genus of a permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001520The number of strict 3-descents. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001556The number of inversions of the third entry of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001730The number of times the path corresponding to a binary word crosses the base line. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000764The number of strong records in an integer composition. 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)$. St000883The number of longest increasing subsequences of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!