searching the database
Your data matches 40 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: St001235
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St001235: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
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,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,0,1,0]
=> [3,1] => 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,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,0,1,0]
=> [1,3,1] => 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,0,1,0,0,1,1,0,0]
=> [2,1,2] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 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".
Matching statistic: St000308
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000308: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000308: Permutations ⟶ ℤ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,2] => [1,2] => 2
[1,1,0,0]
=> [2,1] => [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => 2
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 2
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,3,4,1] => 3
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,3,1,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,1,3] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [3,4,2,1] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,2,4,1] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [4,2,1,3] => 2
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [4,3,1,2] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,3,4,5,1] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,3,4,1,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [2,3,5,1,4] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,4,5,2,1] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,3,1,4,5] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,4,2,5,1] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [2,4,1,3,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,1,3,4] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,5,2,4,1] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [3,4,2,1,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [3,5,2,1,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [3,5,4,1,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [4,5,3,2,1] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [3,2,4,5,1] => 3
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [3,2,4,1,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2,5,1,4] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [4,3,5,2,1] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,2,3,5,1] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [5,2,3,1,4] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [5,2,4,1,3] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,3,4,2,1] => 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,…,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.
Matching statistic: St000381
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00041: Integer compositions —conjugate⟶ Integer 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] => [1,2] => 2
[1,1,0,0,1,0]
=> [2,1] => [2,1] => 2
[1,1,0,1,0,0]
=> [2,1] => [2,1] => 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] => [1,3] => 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] => [1,1,2] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [3,1] => 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] => [3,1] => 3
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [3,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,2,1] => 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [2,1,1] => 2
[1,1,1,0,0,1,0,0]
=> [3,1] => [2,1,1] => 2
[1,1,1,0,1,0,0,0]
=> [3,1] => [2,1,1] => 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] => [1,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,3] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,1,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [3,2] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,2,2] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [3,2] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [3,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,2,2] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [2,1,2] => 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] => [1,1,1,2] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => 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] => [2,2,1] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,2,1] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [4,1] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [4,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,3,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,2,1] => 2
Description
The largest part of an integer composition.
Matching statistic: St000684
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,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,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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≥2. Number those points from the left to the right by 0,1,…,n−1.
The algebra is then uniquely determined by the dimension ci of the projective indecomposable modules at point i. Such algebras are then uniquely determined by lists of the form [c0,c1,...,cn−1] with the conditions: cn−1=1 and ci−1≤ci+1 for all i. The number of such algebras is then the n−1-st Catalan number Cn−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≥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≥2 with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St000686
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,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,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000930: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,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,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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.
Matching statistic: St001239
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck 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,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[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,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [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,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [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,0,0,1,1,0,0]
=> [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,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [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,1,0,0,1,0,0]
=> [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,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
Description
The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra.
Matching statistic: St001530
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001530: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,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,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 3
[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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001294: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,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,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,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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck 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,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,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,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,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,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,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,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,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,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 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,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,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 30 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000013The height of a Dyck path. St000147The largest part of an integer partition. St000328The maximum number of child nodes in a tree. St000392The length of the longest run of ones in a binary word. St000444The length of the maximal rise of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000982The length of the longest constant subword. St001062The maximal size of a block of a set partition. St001372The length of a longest cyclic run of ones of a binary word. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000141The maximum drop size of a permutation. St000209Maximum difference of elements in cycles. St000662The staircase size of the code of a permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001090The number of pop-stack-sorts needed to sort a permutation. St001192The maximal dimension of Ext2A(S,A) for a simple module S over the corresponding Nakayama algebra A. St000485The length of the longest cycle of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000956The maximal displacement of a permutation. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001194The injective dimension of A/AfA in the corresponding Nakayama algebra A when Af is the minimal faithful projective-injective left A-module St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000983The length of the longest alternating subword. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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]/(xn). St001624The breadth of a lattice.
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!