Your data matches 14 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
St001235: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => 2
[[[]]]
=> [1,1,0,0]
=> [2] => 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => 2
Description
The global dimension of the corresponding Comp-Nakayama algebra. We identify the composition [n1-1,n2-1,...,nr-1] with the Nakayama algebra with Kupisch series [n1,n1-1,...,2,n2,n2-1,...,2,...,nr,nr-1,...,3,2,1]. We call such Nakayama algebras with Kupisch series corresponding to a integer composition "Comp-Nakayama algebra".
Mp00049: Ordered trees to binary tree: left brother = left childBinary trees
Mp00014: Binary trees to 132-avoiding permutationPermutations
Mp00066: Permutations inversePermutations
St000308: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [.,.]
=> [1] => [1] => 1
[[],[]]
=> [[.,.],.]
=> [1,2] => [1,2] => 2
[[[]]]
=> [.,[.,.]]
=> [2,1] => [2,1] => 1
[[],[],[]]
=> [[[.,.],.],.]
=> [1,2,3] => [1,2,3] => 3
[[],[[]]]
=> [[.,.],[.,.]]
=> [3,1,2] => [2,3,1] => 2
[[[]],[]]
=> [[.,[.,.]],.]
=> [2,1,3] => [2,1,3] => 2
[[[],[]]]
=> [.,[[.,.],.]]
=> [2,3,1] => [3,1,2] => 2
[[[[]]]]
=> [.,[.,[.,.]]]
=> [3,2,1] => [3,2,1] => 1
[[],[],[],[]]
=> [[[[.,.],.],.],.]
=> [1,2,3,4] => [1,2,3,4] => 4
[[],[],[[]]]
=> [[[.,.],.],[.,.]]
=> [4,1,2,3] => [2,3,4,1] => 3
[[],[[]],[]]
=> [[[.,.],[.,.]],.]
=> [3,1,2,4] => [2,3,1,4] => 2
[[],[[],[]]]
=> [[.,.],[[.,.],.]]
=> [3,4,1,2] => [3,4,1,2] => 2
[[],[[[]]]]
=> [[.,.],[.,[.,.]]]
=> [4,3,1,2] => [3,4,2,1] => 2
[[[]],[],[]]
=> [[[.,[.,.]],.],.]
=> [2,1,3,4] => [2,1,3,4] => 3
[[[]],[[]]]
=> [[.,[.,.]],[.,.]]
=> [4,2,1,3] => [3,2,4,1] => 2
[[[],[]],[]]
=> [[.,[[.,.],.]],.]
=> [2,3,1,4] => [3,1,2,4] => 3
[[[[]]],[]]
=> [[.,[.,[.,.]]],.]
=> [3,2,1,4] => [3,2,1,4] => 2
[[[],[],[]]]
=> [.,[[[.,.],.],.]]
=> [2,3,4,1] => [4,1,2,3] => 3
[[[],[[]]]]
=> [.,[[.,.],[.,.]]]
=> [4,2,3,1] => [4,2,3,1] => 2
[[[[]],[]]]
=> [.,[[.,[.,.]],.]]
=> [3,2,4,1] => [4,2,1,3] => 2
[[[[],[]]]]
=> [.,[.,[[.,.],.]]]
=> [3,4,2,1] => [4,3,1,2] => 2
[[[[[]]]]]
=> [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => [4,3,2,1] => 1
[[],[],[],[],[]]
=> [[[[[.,.],.],.],.],.]
=> [1,2,3,4,5] => [1,2,3,4,5] => 5
[[],[],[],[[]]]
=> [[[[.,.],.],.],[.,.]]
=> [5,1,2,3,4] => [2,3,4,5,1] => 4
[[],[],[[]],[]]
=> [[[[.,.],.],[.,.]],.]
=> [4,1,2,3,5] => [2,3,4,1,5] => 3
[[],[],[[],[]]]
=> [[[.,.],.],[[.,.],.]]
=> [4,5,1,2,3] => [3,4,5,1,2] => 3
[[],[],[[[]]]]
=> [[[.,.],.],[.,[.,.]]]
=> [5,4,1,2,3] => [3,4,5,2,1] => 3
[[],[[]],[],[]]
=> [[[[.,.],[.,.]],.],.]
=> [3,1,2,4,5] => [2,3,1,4,5] => 3
[[],[[]],[[]]]
=> [[[.,.],[.,.]],[.,.]]
=> [5,3,1,2,4] => [3,4,2,5,1] => 2
[[],[[],[]],[]]
=> [[[.,.],[[.,.],.]],.]
=> [3,4,1,2,5] => [3,4,1,2,5] => 3
[[],[[[]]],[]]
=> [[[.,.],[.,[.,.]]],.]
=> [4,3,1,2,5] => [3,4,2,1,5] => 2
[[],[[],[],[]]]
=> [[.,.],[[[.,.],.],.]]
=> [3,4,5,1,2] => [4,5,1,2,3] => 3
[[],[[],[[]]]]
=> [[.,.],[[.,.],[.,.]]]
=> [5,3,4,1,2] => [4,5,2,3,1] => 2
[[],[[[]],[]]]
=> [[.,.],[[.,[.,.]],.]]
=> [4,3,5,1,2] => [4,5,2,1,3] => 2
[[],[[[],[]]]]
=> [[.,.],[.,[[.,.],.]]]
=> [4,5,3,1,2] => [4,5,3,1,2] => 2
[[],[[[[]]]]]
=> [[.,.],[.,[.,[.,.]]]]
=> [5,4,3,1,2] => [4,5,3,2,1] => 2
[[[]],[],[],[]]
=> [[[[.,[.,.]],.],.],.]
=> [2,1,3,4,5] => [2,1,3,4,5] => 4
[[[]],[],[[]]]
=> [[[.,[.,.]],.],[.,.]]
=> [5,2,1,3,4] => [3,2,4,5,1] => 3
[[[]],[[]],[]]
=> [[[.,[.,.]],[.,.]],.]
=> [4,2,1,3,5] => [3,2,4,1,5] => 2
[[[]],[[],[]]]
=> [[.,[.,.]],[[.,.],.]]
=> [4,5,2,1,3] => [4,3,5,1,2] => 2
[[[]],[[[]]]]
=> [[.,[.,.]],[.,[.,.]]]
=> [5,4,2,1,3] => [4,3,5,2,1] => 2
[[[],[]],[],[]]
=> [[[.,[[.,.],.]],.],.]
=> [2,3,1,4,5] => [3,1,2,4,5] => 4
[[[[]]],[],[]]
=> [[[.,[.,[.,.]]],.],.]
=> [3,2,1,4,5] => [3,2,1,4,5] => 3
[[[],[]],[[]]]
=> [[.,[[.,.],.]],[.,.]]
=> [5,2,3,1,4] => [4,2,3,5,1] => 3
[[[[]]],[[]]]
=> [[.,[.,[.,.]]],[.,.]]
=> [5,3,2,1,4] => [4,3,2,5,1] => 2
[[[],[],[]],[]]
=> [[.,[[[.,.],.],.]],.]
=> [2,3,4,1,5] => [4,1,2,3,5] => 4
[[[],[[]]],[]]
=> [[.,[[.,.],[.,.]]],.]
=> [4,2,3,1,5] => [4,2,3,1,5] => 2
[[[[]],[]],[]]
=> [[.,[[.,[.,.]],.]],.]
=> [3,2,4,1,5] => [4,2,1,3,5] => 3
[[[[],[]]],[]]
=> [[.,[.,[[.,.],.]]],.]
=> [3,4,2,1,5] => [4,3,1,2,5] => 3
[[[[[]]]],[]]
=> [[.,[.,[.,[.,.]]]],.]
=> [4,3,2,1,5] => [4,3,2,1,5] => 2
Description
The height of the tree associated to a permutation. A permutation can be mapped to a rooted tree with vertices $\{0,1,2,\ldots,n\}$ and root $0$ in the following way. Entries of the permutations are inserted one after the other, each child is larger than its parent and the children are in strict order from left to right. Details of the construction are found in [1]. The statistic is given by the height of this tree. See also [[St000325]] for the width of this tree.
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00039: Integer compositions complementInteger compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1] => 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [2] => 2
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1] => 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [3] => 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [2,1] => 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,2] => 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,2] => 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1] => 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [3,1] => 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,2] => 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,2] => 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [2,1,1] => 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,3] => 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,2,1] => 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,3] => 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,2] => 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,3] => 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,2,1] => 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,2] => 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,2] => 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [5] => 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [4,1] => 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [3,2] => 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [3,2] => 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1] => 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,3] => 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1] => 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,3] => 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [2,1,2] => 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,3] => 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1] => 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [2,1,2] => 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [2,1,2] => 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [2,1,1,1] => 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,4] => 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,2,2] => 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,2,2] => 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,2,1,1] => 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,4] => 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,2,1] => 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,4] => 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,2,2] => 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,2] => 2
Description
The largest part of an integer composition.
Matching statistic: St000684
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 2
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
Description
The global dimension of the LNakayama algebra associated to a Dyck path. An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$. The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$. One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0]. Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$. Examples: * For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192. * For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St000686
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 2
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
Description
The finitistic dominant dimension of a Dyck path. To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
Matching statistic: St000930
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000930: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 2
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
Description
The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. The $k$-Gorenstein degree is the maximal number $k$ such that the algebra is $k$-Gorenstein. We apply the convention that the value is equal to the global dimension of the algebra in case the $k$-Gorenstein degree is greater than or equal to the global dimension.
Mp00049: Ordered trees to binary tree: left brother = left childBinary trees
Mp00012: Binary trees to Dyck path: up step, left tree, down step, right treeDyck paths
Mp00222: Dyck paths peaks-to-valleysDyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [.,.]
=> [1,0]
=> [1,0]
=> 1
[[],[]]
=> [[.,.],.]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[[[]]]
=> [.,[.,.]]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[[],[],[]]
=> [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 3
[[],[[]]]
=> [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[[[]],[]]
=> [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[[[],[]]]
=> [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[[[[]]]]
=> [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[[],[],[],[]]
=> [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4
[[],[],[[]]]
=> [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[[],[[]],[]]
=> [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[[],[[],[]]]
=> [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[[],[[[]]]]
=> [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[[[]],[],[]]
=> [[[.,[.,.]],.],.]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[[[]],[[]]]
=> [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[[[],[]],[]]
=> [[.,[[.,.],.]],.]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3
[[[[]]],[]]
=> [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[[],[],[]]]
=> [.,[[[.,.],.],.]]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[[[],[[]]]]
=> [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[[[]],[]]]
=> [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[[[[],[]]]]
=> [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[[[[[]]]]]
=> [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[[],[],[],[],[]]
=> [[[[[.,.],.],.],.],.]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5
[[],[],[],[[]]]
=> [[[[.,.],.],.],[.,.]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4
[[],[],[[]],[]]
=> [[[[.,.],.],[.,.]],.]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[[],[],[[],[]]]
=> [[[.,.],.],[[.,.],.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[[],[],[[[]]]]
=> [[[.,.],.],[.,[.,.]]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[[],[[]],[],[]]
=> [[[[.,.],[.,.]],.],.]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3
[[],[[]],[[]]]
=> [[[.,.],[.,.]],[.,.]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[[],[[],[]],[]]
=> [[[.,.],[[.,.],.]],.]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[[],[[[]]],[]]
=> [[[.,.],[.,[.,.]]],.]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[[],[[],[],[]]]
=> [[.,.],[[[.,.],.],.]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[[],[[],[[]]]]
=> [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[[]],[]]]
=> [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[[],[[[],[]]]]
=> [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[[]]]]]
=> [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[[[]],[],[],[]]
=> [[[[.,[.,.]],.],.],.]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4
[[[]],[],[[]]]
=> [[[.,[.,.]],.],[.,.]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[[[]],[[]],[]]
=> [[[.,[.,.]],[.,.]],.]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[[[]],[[],[]]]
=> [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[[[]],[[[]]]]
=> [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[[[],[]],[],[]]
=> [[[.,[[.,.],.]],.],.]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[[[[]]],[],[]]
=> [[[.,[.,[.,.]]],.],.]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[[[],[]],[[]]]
=> [[.,[[.,.],.]],[.,.]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3
[[[[]]],[[]]]
=> [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2
[[[],[],[]],[]]
=> [[.,[[[.,.],.],.]],.]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4
[[[],[[]]],[]]
=> [[.,[[.,.],[.,.]]],.]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[[[[]],[]],[]]
=> [[.,[[.,[.,.]],.]],.]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
[[[[],[]]],[]]
=> [[.,[.,[[.,.],.]]],.]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[[[[[]]]],[]]
=> [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
Description
The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra.
Matching statistic: St001530
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001530: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 2
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 3
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 2
Description
The depth of a Dyck path. That is the depth of the corresponding Nakayama algebra with a linear quiver.
Matching statistic: St001294
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001294: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1 = 2 - 1
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
Description
The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]]. The number of algebras where the statistic returns a value less than or equal to 1 might be given by the Motzkin numbers https://oeis.org/A001006.
Matching statistic: St001296
Mp00051: Ordered trees to Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001296: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[[],[]]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1 = 2 - 1
[[[]]]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[]]]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[[[]],[]]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[[[],[]]]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[[[[]]]]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
Description
The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]].
The following 4 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000444The length of the maximal rise of a Dyck path. St001062The maximal size of a block of a set partition. St000392The length of the longest run of ones in a binary word. St001330The hat guessing number of a graph.