searching the database
Your data matches 110 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: St000118
(load all 25 compositions to match this statistic)
(load all 25 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,0,1,0]
=> [[.,.],.]
=> 0
[1,1,0,0]
=> [.,[.,.]]
=> 0
[1,0,1,0,1,0]
=> [[[.,.],.],.]
=> 0
[1,0,1,1,0,0]
=> [[.,.],[.,.]]
=> 0
[1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 0
[1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 0
[1,1,1,0,0,0]
=> [.,[.,[.,.]]]
=> 1
[1,0,1,0,1,0,1,0]
=> [[[[.,.],.],.],.]
=> 0
[1,0,1,0,1,1,0,0]
=> [[[.,.],.],[.,.]]
=> 0
[1,0,1,1,0,0,1,0]
=> [[[.,.],[.,.]],.]
=> 0
[1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 0
[1,0,1,1,1,0,0,0]
=> [[.,.],[.,[.,.]]]
=> 1
[1,1,0,0,1,0,1,0]
=> [[[.,[.,.]],.],.]
=> 0
[1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 0
[1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 0
[1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 0
[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]
=> [.,[[.,[.,.]],.]]
=> 0
[1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 1
[1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [[[[[.,.],.],.],.],.]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[[[.,.],.],.],[.,.]]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[[[.,.],.],[.,.]],.]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[[.,.],.],[.,[.,.]]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[[[.,.],[.,.]],.],.]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[[.,.],[[.,.],.]],.]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[.,.],[[.,.],[.,.]]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [[[[.,[.,.]],.],.],.]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[.,[.,.]],[.,[.,.]]]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[[[.,.],.],.]],.]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 0
[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]
=> [.,[[[.,.],[.,.]],.]]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 2
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,.]]]}}} in a binary tree.
[[oeis:A001006]] counts binary trees avoiding this pattern.
Matching statistic: St001066
(load all 39 compositions to match this statistic)
(load all 39 compositions to match this statistic)
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001066: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001066: 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
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
Description
The number of simple reflexive modules in the corresponding Nakayama algebra.
Matching statistic: St001483
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00028: Dyck paths —reverse⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001483: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001483: 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 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 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: St000052
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ 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] => [1,0]
=> 0
[1,0,1,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 0
[1,1,1,0,0,0]
=> [3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> 2
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: 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,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => {{1},{2}}
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => {{1,2}}
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => {{1,2},{3}}
=> 0
[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,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => {{1,3},{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,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,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,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,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
[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,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,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,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,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
[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
[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,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
[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
[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,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,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,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,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
[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,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,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,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,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
[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
[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,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
[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
[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,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,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,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,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
[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,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,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,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,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
[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
[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,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
[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
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$.
Matching statistic: St000931
(load all 37 compositions to match this statistic)
(load all 37 compositions to match this statistic)
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000931: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000931: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [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,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [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,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [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,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [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,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [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,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [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,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [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,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [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,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
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
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00071: Permutations —descent 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%
Mp00071: Permutations —descent 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%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 0
[1,0,1,0]
=> [1,2] => [2] => [1,1,0,0]
=> 0
[1,1,0,0]
=> [2,1] => [1,1] => [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,2,3] => [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,1,0,0,0]
=> [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2
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
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00071: Permutations —descent 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%
Mp00071: Permutations —descent 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%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 0
[1,0,1,0]
=> [1,2] => [2] => [1,1,0,0]
=> 0
[1,1,0,0]
=> [2,1] => [1,1] => [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,2,3] => [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,1,0,0,0]
=> [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2
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: St001323
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001323: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001323: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([(0,1)],2)
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(1,2)],3)
=> 0
[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,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 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] => ([],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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,3),(2,3)],4)
=> 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] => ([(2,3)],4)
=> 0
[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] => ([(0,3),(1,2)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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,3),(2,3)],4)
=> 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,3)],4)
=> 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] => ([(0,3),(1,2)],4)
=> 0
[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,3),(2,3)],4)
=> 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] => ([(0,3),(1,3),(2,3)],4)
=> 2
[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] => ([],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(2,4),(3,4)],5)
=> 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,4),(2,3)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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,4),(2,4),(3,4)],5)
=> 2
[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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(0,1),(2,4),(3,4)],5)
=> 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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(2,4),(3,4)],5)
=> 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,4),(2,3)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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,4),(2,4),(3,4)],5)
=> 2
Description
The independence gap of a graph.
This is the difference between the independence number [[St000093]] and the minimal size of a maximally independent set of a graph.
In particular, this statistic is $0$ for well covered graphs
Matching statistic: St001723
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([(0,1)],2)
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(1,2)],3)
=> 0
[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,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 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] => ([],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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,3),(2,3)],4)
=> 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] => ([(2,3)],4)
=> 0
[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] => ([(0,3),(1,2)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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] => ([(2,3)],4)
=> 0
[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,3),(2,3)],4)
=> 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,3)],4)
=> 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] => ([(0,3),(1,2)],4)
=> 0
[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,3),(2,3)],4)
=> 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] => ([(0,3),(1,3),(2,3)],4)
=> 2
[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] => ([],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(2,4),(3,4)],5)
=> 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,4),(2,3)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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,4),(2,4),(3,4)],5)
=> 2
[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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(0,1),(2,4),(3,4)],5)
=> 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] => ([(3,4)],5)
=> 0
[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,4),(2,3)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(3,4)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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] => ([(2,4),(3,4)],5)
=> 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,4),(2,3)],5)
=> 0
[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] => ([(2,4),(3,4)],5)
=> 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,4),(2,4),(3,4)],5)
=> 2
Description
The differential of a graph.
The external neighbourhood (or boundary) of a set of vertices $S\subseteq V(G)$ is the set of vertices not in $S$ which are adjacent to a vertex in $S$.
The differential of a set of vertices $S\subseteq V(G)$ is the difference of the size of the external neighbourhood of $S$ and the size of $S$.
The differential of a graph is the maximal differential of a set of vertices.
The following 100 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
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. 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. St000470The number of runs in a permutation. 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. St000619The number of cyclic descents of a permutation. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. 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. 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. 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. St000365The number of double ascents of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000019The cardinality of the support of a permutation. St000214The number of adjacencies of a permutation. St000932The number of occurrences of the pattern UDU in 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. St000223The number of nestings in the permutation. St000359The number of occurrences of the pattern 23-1. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. 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. St000039The number of crossings of a permutation. St000317The cycle descent number of a permutation. 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. 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. St001130The number of two successive successions in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000325The width of the tree associated to a permutation. St001330The hat guessing number of a graph. St001640The number of ascent tops in the permutation such that all smaller elements appear before. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. 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. St001811The Castelnuovo-Mumford regularity of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000914The sum of the values of the Möbius function of a poset. St001964The interval resolution global dimension of a poset. St001866The nesting alignments of a signed permutation. St000181The number of connected components of the Hasse diagram for the poset. St001890The maximum magnitude of the Möbius function of a poset. St000983The length of the longest alternating subword. St001862The number of crossings of a signed permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St000982The length of the longest constant subword. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001948The number of augmented double ascents of a permutation. St001060The distinguishing index of a graph. St000381The largest part of an integer composition. St000392The length of the longest run of ones in a binary word. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. 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)$.
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!