searching the database
Your data matches 697 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: St001256
(load all 123 compositions to match this statistic)
(load all 123 compositions to match this statistic)
St001256: 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]
=> 1
[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]
=> 1
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 1
[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]
=> 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]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 1
[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,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[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]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[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,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]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
Number of simple reflexive modules that are 2-stable reflexive.
See Definition 3.1. in the reference for the definition of 2-stable reflexive.
Matching statistic: St000126
(load all 73 compositions to match this statistic)
(load all 73 compositions to match this statistic)
Mp00029: Dyck paths āto binary tree: left tree, up step, right tree, down stepā¶ Binary trees
St000126: Binary trees ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St000126: 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]
=> [.,[.,[.,.]]]
=> 0 = 1 - 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]
=> [[.,.],[.,[.,.]]]
=> 0 = 1 - 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]
=> [.,[[.,.],[.,.]]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [[.,[.,[.,.]]],.]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 0 = 1 - 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]
=> [[[.,.],.],[.,[.,.]]]
=> 0 = 1 - 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]
=> [[.,.],[[.,.],[.,.]]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 0 = 1 - 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]
=> [[.,[.,.]],[.,[.,.]]]
=> 0 = 1 - 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]
=> [.,[[[.,.],.],[.,.]]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],[.,.]]],.]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 0 = 1 - 1
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,[.,[.,.]]]]]}}} in a binary tree.
[[oeis:A036766]] counts binary trees avoiding this pattern.
Matching statistic: St001210
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001210: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001210: 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,0,1,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
Description
Gives 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.
Matching statistic: St001733
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
Mp00101: Dyck paths ādecomposition reverseā¶ Dyck paths
St001733: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00101: Dyck paths ādecomposition reverseā¶ Dyck paths
St001733: 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,0,1,0]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,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,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 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
[1,0,1,0,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,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,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,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [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]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 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
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,0,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
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,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
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,0,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
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
Description
The number of weak left to right maxima of a Dyck path.
A weak left to right maximum is a peak whose height is larger than or equal to the height of all peaks to its
left.
Matching statistic: St000954
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St000954: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St000954: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 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]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 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]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,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]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,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]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,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]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
Description
Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$.
Matching statistic: St001033
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001033: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001033: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,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,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 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,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
Description
The normalized area of the parallelogram polyomino associated with the Dyck path.
The area of the smallest parallelogram polyomino equals the semilength of the Dyck path. This statistic is therefore the area of the parallelogram polyomino minus the semilength of the Dyck path.
The area itself is equidistributed with [[St001034]] and with [[St000395]].
Matching statistic: St001189
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
Mp00124: Dyck paths āAdin-Bagno-Roichman transformationā¶ Dyck paths
St001189: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00124: Dyck paths āAdin-Bagno-Roichman transformationā¶ Dyck paths
St001189: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001233
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001233: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00103: Dyck paths āpeeling mapā¶ Dyck paths
St001233: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,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,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 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,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
Description
The number of indecomposable 2-dimensional modules with projective dimension one.
Matching statistic: St001550
(load all 151 compositions to match this statistic)
(load all 151 compositions to match this statistic)
Mp00031: Dyck paths āto 312-avoiding permutationā¶ Permutations
Mp00325: Permutations āones to leadingā¶ Permutations
St001550: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00325: Permutations āones to leadingā¶ Permutations
St001550: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [2,1] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,3,2] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,1,3] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,3,4,1] => 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,4,3] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,3,1,4] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [3,4,2,1] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,3,2,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,3,1] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,4,2,3] => 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,1,4,3] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,1,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,4,3,2] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,1,3,4] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,2,4,1] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,1,2] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,3,4,5,1] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,5,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [2,3,4,1,5] => 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,4,5,2,1] => 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,4,3,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,3,5,4,1] => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,5,3,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,3,1,5,4] => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,4,2,1,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,5,4,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [2,3,1,4,5] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [3,4,2,5,1] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [4,5,3,1,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,3,2,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,4,3,5,1] => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,3,1,5] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [3,5,4,2,1] => 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,4,2,3,5] => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,5,3,4,1] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,5,2,3,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,1,5,4,3] => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,2,1,5,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,5,2,4,3] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [2,1,4,5,3] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [3,2,5,1,4] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,3,1,2,5] => 0 = 1 - 1
Description
The number of inversions between exceedances where the greater exceedance is linked.
This is for a permutation $\sigma$ of length $n$ given by
$$\operatorname{ile}(\sigma) = \#\{1 \leq i, j \leq n \mid i < j < \sigma(j) < \sigma(i) \wedge \sigma^{-1}(j) < j \}.$$
Matching statistic: St001551
(load all 154 compositions to match this statistic)
(load all 154 compositions to match this statistic)
Mp00201: Dyck paths āRingelā¶ Permutations
Mp00252: Permutations ārestrictionā¶ Permutations
St001551: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00252: Permutations ārestrictionā¶ Permutations
St001551: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [3,1,2] => [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [2,3,1] => [2,1] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [2,1,3] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [3,1,2] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [2,3,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [4,1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,1,2,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [1,4,2,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,4,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [2,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [2,4,1,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [3,1,2,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [4,1,2,3] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,3,1,2] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [2,3,1,4] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [2,4,1,3] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [3,4,1,2] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [2,3,4,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [5,1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [4,1,2,3,5] => 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [1,2,5,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [4,1,2,5,3] => 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,1,2,4,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,2,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [1,4,2,3,5] => 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [1,5,2,3,4] => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [5,1,4,2,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,1,4,2,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,1,5,2,4] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [1,4,5,2,3] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,1,4,5,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [2,1,3,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [2,5,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [2,4,1,3,5] => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [2,1,5,3,4] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [2,4,1,5,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [3,1,2,4,5] => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [5,3,1,2,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [4,1,2,3,5] => 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [5,1,2,3,4] => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [5,4,1,2,3] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,3,1,2,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [3,1,5,2,4] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [4,1,5,2,3] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [4,3,1,5,2] => 0 = 1 - 1
Description
The number of restricted non-inversions between exceedances where the rightmost exceedance is linked.
This is for a permutation $\sigma$ of length $n$ given by
$$\operatorname{nie}(\sigma) = \#\{1 \leq i, j \leq n \mid i < j < \sigma(i) < \sigma(j) \wedge \sigma^{-1}(j) < j \}.$$
The following 687 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001810The number of fixed points of a permutation smaller than its largest moved point. St000011The number of touch points (or returns) of a Dyck path. St000255The number of reduced Kogan faces with the permutation as type. St000816The number of standard composition tableaux of the composition. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{nā1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. 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. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001732The number of peaks visible from the left. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. 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. St000220The number of occurrences of the pattern 132 in a permutation. St000232The number of crossings of a set partition. St000233The number of nestings of a set partition. St000237The number of small exceedances. St000359The number of occurrences of the pattern 23-1. St000366The number of double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000504The cardinality of the first block of a set partition. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000731The number of double exceedences of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. 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. St001022Number of simple modules with projective dimension 3 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. St001083The number of boxed occurrences of 132 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 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. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. 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. St001394The genus of a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000674The number of hills of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St001130The number of two successive successions in a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000570The Edelman-Greene number of a permutation. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000823The number of unsplittable factors of the set partition. St001162The minimum jump of a permutation. St001333The cardinality of a minimal edge-isolating set of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000317The cycle descent number of a permutation. St000358The number of occurrences of the pattern 31-2. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000623The number of occurrences of the pattern 52341 in a permutation. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000710The number of big deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St000962The 3-shifted major index of a permutation. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001271The competition number of a graph. St000732The number of double deficiencies of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001797The number of overfull subgraphs of a graph. St000842The breadth of a permutation. St000617The number of global maxima of a Dyck path. St000627The exponent of a binary word. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. 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}$. St001344The neighbouring number of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000326The position of the first one in a binary word after appending a 1 at the end. St001267The length of the Lyndon factorization of the binary word. St001437The flex of a binary word. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001884The number of borders of a binary word. St000920The logarithmic height of a Dyck path. St000781The number of proper colouring schemes of a Ferrers diagram. St000655The length of the minimal rise of a Dyck path. St000706The product of the factorials of the multiplicities of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000878The number of ones minus the number of zeros of a binary word. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St000028The number of stack-sorts needed to sort a permutation. St000701The protection number of a binary tree. St001518The number of graphs with the same ordinary spectrum as the given graph. St000007The number of saliances of the permutation. St000666The number of right tethers of a permutation. St000871The number of very big ascents of a permutation. St001571The Cartan determinant of the integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001651The Frankl number of a lattice. St000516The number of stretching pairs of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St001568The smallest positive integer that does not appear twice in the partition. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000223The number of nestings in the permutation. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000451The length of the longest pattern of the form k 1 2. St001624The breadth of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001877Number of indecomposable injective modules with projective dimension 2. St000031The number of cycles in the cycle decomposition of a permutation. St000669The number of permutations obtained by switching ascents or descents of size 2. St000696The number of cycles in the breakpoint graph of a permutation. St000002The number of occurrences of the pattern 123 in a permutation. St000022The number of fixed points of a permutation. St000441The number of successions of a permutation. St000534The number of 2-rises of a permutation. St000665The number of rafts of a permutation. St000284The Plancherel distribution on integer partitions. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St000996The number of exclusive left-to-right maxima of a permutation. St000648The number of 2-excedences of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St000035The number of left outer peaks of a permutation. St000068The number of minimal elements in a poset. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St000864The number of circled entries of the shifted recording tableau of a permutation. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. 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. St000234The number of global ascents of a permutation. St000297The number of leading ones in a binary word. St000296The length of the symmetric border of a binary word. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000115The single entry in the last row. St000629The defect of a binary word. St000069The number of maximal elements of a poset. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000934The 2-degree of an integer partition. St000003The number of standard Young tableaux of the partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000913The number of ways to refine the partition into singletons. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. 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. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000260The radius of a connected graph. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001933The largest multiplicity of a part in an integer partition. St000764The number of strong records in an integer composition. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000649The number of 3-excedences of a permutation. St000763The sum of the positions of the strong records of an integer composition. St000805The number of peaks of the associated bargraph. St001964The interval resolution global dimension of a poset. St000407The number of occurrences of the pattern 2143 in a permutation. St000355The number of occurrences of the pattern 21-3. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St001272The number of graphs with the same degree sequence. St001316The domatic number of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001546The number of monomials in the Tutte polynomial of a graph. St000323The minimal crossing number of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000637The length of the longest cycle in a graph. St000671The maximin edge-connectivity for choosing a subgraph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001119The length of a shortest maximal path in a graph. St001305The number of induced cycles on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001357The maximal degree of a regular spanning subgraph of a graph. St001395The number of strictly unfriendly partitions of a graph. St001638The book thickness of a graph. St001689The number of celebrities in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001736The total number of cycles in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St000273The domination number of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000916The packing number of a graph. St001597The Frobenius rank of a skew partition. St001739The number of graphs with the same edge polytope as the given graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001829The common independence number of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St001306The number of induced paths on four vertices in a graph. St001596The number of two-by-two squares inside a skew partition. St000379The number of Hamiltonian cycles in a graph. St000699The toughness times the least common multiple of 1,. St001281The normalized isoperimetric number of a graph. St000356The number of occurrences of the pattern 13-2. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000733The row containing the largest entry of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000264The girth of a graph, which is not a tree. St000078The number of alternating sign matrices whose left key is the permutation. St000217The number of occurrences of the pattern 312 in a permutation. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001705The number of occurrences of the pattern 2413 in a permutation. St000546The number of global descents of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000788The number of nesting-similar perfect matchings of a perfect matching. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001845The number of join irreducibles minus the rank of a lattice. St000889The number of alternating sign matrices with the same antidiagonal sums. St000741The Colin de VerdiĆØre graph invariant. St000058The order of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001590The crossing number of a perfect matching. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St000352The Elizalde-Pak rank of a permutation. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St000322The skewness of a graph. St001545The second Elser number of a connected graph. St000100The number of linear extensions of a poset. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. 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. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001890The maximum magnitude of the Mƶbius function of a poset. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St000664The number of right ropes of a permutation. St001720The minimal length of a chain of small intervals in a lattice. St001846The number of elements which do not have a complement in the lattice. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000095The number of triangles of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000310The minimal degree of a vertex of a graph. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001578The minimal number of edges to add or remove to make a graph a line graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001871The number of triconnected components of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001765The number of connected components of the friends and strangers graph. St000989The number of final rises of a permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St000056The decomposition (or block) number of a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St001461The number of topologically connected components of the chord diagram of a permutation. St000054The first entry of the permutation. St000478Another weight of a partition according to Alladi. St001947The number of ties in a parking function. St000065The number of entries equal to -1 in an alternating sign matrix. St001570The minimal number of edges to add to make a graph Hamiltonian. St000877The depth of the binary word interpreted as a path. St001060The distinguishing index of a graph. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000117The number of centered tunnels of a Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{nā1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000654The first descent of a permutation. St001621The number of atoms of a lattice. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001735The number of permutations with the same set of runs. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St000445The number of rises of length 1 of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001665The number of pure excedances of a permutation. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001856The number of edges in the reduced word graph of a permutation. St000099The number of valleys of a permutation, including the boundary. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000387The matching number of a graph. St000456The monochromatic index of a connected graph. St000536The pathwidth of a graph. St000740The last entry of a permutation. St000884The number of isolated descents of a permutation. St000991The number of right-to-left minima of a permutation. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001286The annihilation number of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001652The length of a longest interval of consecutive numbers. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St000023The number of inner peaks of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000133The "bounce" of a permutation. St000221The number of strong fixed points of a permutation. St000308The height of the tree associated to a permutation. St000357The number of occurrences of the pattern 12-3. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000396The register function (or Horton-Strahler number) of a binary tree. St000461The rix statistic of a permutation. St000624The normalized sum of the minimal distances to a greater element. St000650The number of 3-rises of a permutation. St000663The number of right floats of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000779The tier of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000872The number of very big descents of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module 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. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001835The number of occurrences of a 231 pattern in the restricted growth word of a perfect matching. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001330The hat guessing number of a graph. St001811The Castelnuovo-Mumford regularity of a permutation. St001948The number of augmented double ascents of a permutation. St001111The weak 2-dynamic chromatic number of a graph. St001434The number of negative sum pairs of a signed permutation. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000917The open packing number of a graph. St001672The restrained domination number of a graph. St000258The burning number of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000918The 2-limited packing number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St001432The order dimension of the partition. St001780The order of promotion on the set of standard tableaux of given shape. 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. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000181The number of connected components of the Hasse diagram for the poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001875The number of simple modules with projective dimension at most 1. St000382The first part of an integer composition. St000066The column of the unique '1' in the first row of the alternating sign matrix. St001429The number of negative entries in a signed permutation. St000667The greatest common divisor of the parts of the partition. St000153The number of adjacent cycles of a permutation. St000862The number of parts of the shifted shape of a permutation. St000618The number of self-evacuating tableaux of given shape. St001280The number of parts of an integer partition that are at least two. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001095The number of non-isomorphic posets with precisely one further covering relation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St000895The number of ones on the main diagonal of an alternating sign matrix. St001004The number of indices that are either left-to-right maxima or right-to-left minima. 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$. St000487The length of the shortest cycle of a permutation. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000990The first ascent of a permutation. St001468The smallest fixpoint of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000210Minimum over maximum difference of elements in cycles. St000381The largest part of an integer composition. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000124The cardinality of the preimage of the Simion-Schmidt map. St001260The permanent of an alternating sign matrix. St000383The last part of an integer composition. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St000753The Grundy value for the game of Kayles on a binary word. St000787The number of flips required to make a perfect matching noncrossing. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001889The size of the connectivity set of a signed permutation. St000807The sum of the heights of the valleys of the associated bargraph. St001381The fertility of a permutation. St000392The length of the longest run of ones in a binary word. St000983The length of the longest alternating subword. St000298The order dimension or Dushnik-Miller dimension of a poset. St000717The number of ordinal summands of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001536The number of cyclic misalignments of a permutation. 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. St000885The number of critical steps in the Catalan decomposition of a binary word. St000883The number of longest increasing subsequences of a permutation. St000496The rcs statistic of a set partition. St001115The number of even descents of a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St000295The length of the border of a binary word. St000657The smallest part of an integer composition. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000894The trace of an alternating sign matrix. St000943The number of spots the most unlucky car had to go further in a parking function. St001131The number of trivial trees on the path to label one in the decreasing labelled binary unordered tree associated with the perfect matching. St001413Half the length of the longest even length palindromic prefix of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001524The degree of symmetry of a binary word. St001557The number of inversions of the second entry of a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001831The multiplicity of the non-nesting perfect matching in the chord expansion of a perfect matching. St001850The number of Hecke atoms of a permutation. St000033The number of permutations greater than or equal to the given permutation in (strong) Bruhat order. St000061The number of nodes on the left branch of a binary tree. St000084The number of subtrees. St000096The number of spanning trees of a graph. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000450The number of edges minus the number of vertices plus 2 of a graph. St000545The number of parabolic double cosets with minimal element being the given permutation. St000630The length of the shortest palindromic decomposition of a binary word. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000756The sum of the positions of the left to right maxima of a permutation. St000762The sum of the positions of the weak records of an integer composition. St000765The number of weak records in an integer composition. St000843The decomposition number of a perfect matching. St000873The aix statistic of a permutation. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000924The number of topologically connected components of a perfect matching. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001048The number of leaves in the subtree containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001081The number of minimal length factorizations of a permutation into star transpositions. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001768The number of reduced words of a signed permutation. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001828The Euler characteristic of a graph. St001851The number of Hecke atoms of a signed permutation. St000042The number of crossings of a perfect matching. St000051The size of the left subtree of a binary tree. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000313The number of degree 2 vertices of a graph. St000315The number of isolated vertices of a graph. St000338The number of pixed points of a permutation. St000485The length of the longest cycle of a permutation. St000488The number of cycles of a permutation of length at most 2. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000682The Grundy value of Welter's game on a binary word. St000754The Grundy value for the game of removing nestings in a perfect matching. St000761The number of ascents in an integer composition. St000768The number of peaks in an integer composition. St000822The Hadwiger number of the graph. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001049The smallest label in the subtree not containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001061The number of indices that are both descents and recoils of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001430The number of positive entries in a signed permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001741The largest integer such that all patterns of this size are contained in the permutation. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra 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)$. St000729The minimal arc length of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001052The length of the exterior of a permutation. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000498The lcs statistic of a set partition. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St001857The number of edges in the reduced word graph of a signed permutation. St001927Sparre Andersen's number of positives of a signed permutation. St000635The number of strictly order preserving maps of a poset into itself.
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!