searching the database
Your data matches 203 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: St000094
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
St000094: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> 2
[[],[]]
=> 2
[[[]]]
=> 3
[[],[],[]]
=> 2
[[],[[]]]
=> 3
[[[]],[]]
=> 3
[[[],[]]]
=> 3
[[[[]]]]
=> 4
[[],[],[],[]]
=> 2
[[],[],[[]]]
=> 3
[[],[[]],[]]
=> 3
[[],[[],[]]]
=> 3
[[],[[[]]]]
=> 4
[[[]],[],[]]
=> 3
[[[]],[[]]]
=> 3
[[[],[]],[]]
=> 3
[[[[]]],[]]
=> 4
[[[],[],[]]]
=> 3
[[[],[[]]]]
=> 4
[[[[]],[]]]
=> 4
[[[[],[]]]]
=> 4
[[[[[]]]]]
=> 5
[[],[],[],[],[]]
=> 2
[[],[],[],[[]]]
=> 3
[[],[],[[]],[]]
=> 3
[[],[],[[],[]]]
=> 3
[[],[],[[[]]]]
=> 4
[[],[[]],[],[]]
=> 3
[[],[[]],[[]]]
=> 3
[[],[[],[]],[]]
=> 3
[[],[[[]]],[]]
=> 4
[[],[[],[],[]]]
=> 3
[[],[[],[[]]]]
=> 4
[[],[[[]],[]]]
=> 4
[[],[[[],[]]]]
=> 4
[[],[[[[]]]]]
=> 5
[[[]],[],[],[]]
=> 3
[[[]],[],[[]]]
=> 3
[[[]],[[]],[]]
=> 3
[[[]],[[],[]]]
=> 3
[[[]],[[[]]]]
=> 4
[[[],[]],[],[]]
=> 3
[[[[]]],[],[]]
=> 4
[[[],[]],[[]]]
=> 3
[[[[]]],[[]]]
=> 4
[[[],[],[]],[]]
=> 3
[[[],[[]]],[]]
=> 4
[[[[]],[]],[]]
=> 4
[[[[],[]]],[]]
=> 4
[[[[[]]]],[]]
=> 5
Description
The depth of an ordered tree.
Matching statistic: St000166
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
St000166: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> 1 = 2 - 1
[[],[]]
=> 1 = 2 - 1
[[[]]]
=> 2 = 3 - 1
[[],[],[]]
=> 1 = 2 - 1
[[],[[]]]
=> 2 = 3 - 1
[[[]],[]]
=> 2 = 3 - 1
[[[],[]]]
=> 2 = 3 - 1
[[[[]]]]
=> 3 = 4 - 1
[[],[],[],[]]
=> 1 = 2 - 1
[[],[],[[]]]
=> 2 = 3 - 1
[[],[[]],[]]
=> 2 = 3 - 1
[[],[[],[]]]
=> 2 = 3 - 1
[[],[[[]]]]
=> 3 = 4 - 1
[[[]],[],[]]
=> 2 = 3 - 1
[[[]],[[]]]
=> 2 = 3 - 1
[[[],[]],[]]
=> 2 = 3 - 1
[[[[]]],[]]
=> 3 = 4 - 1
[[[],[],[]]]
=> 2 = 3 - 1
[[[],[[]]]]
=> 3 = 4 - 1
[[[[]],[]]]
=> 3 = 4 - 1
[[[[],[]]]]
=> 3 = 4 - 1
[[[[[]]]]]
=> 4 = 5 - 1
[[],[],[],[],[]]
=> 1 = 2 - 1
[[],[],[],[[]]]
=> 2 = 3 - 1
[[],[],[[]],[]]
=> 2 = 3 - 1
[[],[],[[],[]]]
=> 2 = 3 - 1
[[],[],[[[]]]]
=> 3 = 4 - 1
[[],[[]],[],[]]
=> 2 = 3 - 1
[[],[[]],[[]]]
=> 2 = 3 - 1
[[],[[],[]],[]]
=> 2 = 3 - 1
[[],[[[]]],[]]
=> 3 = 4 - 1
[[],[[],[],[]]]
=> 2 = 3 - 1
[[],[[],[[]]]]
=> 3 = 4 - 1
[[],[[[]],[]]]
=> 3 = 4 - 1
[[],[[[],[]]]]
=> 3 = 4 - 1
[[],[[[[]]]]]
=> 4 = 5 - 1
[[[]],[],[],[]]
=> 2 = 3 - 1
[[[]],[],[[]]]
=> 2 = 3 - 1
[[[]],[[]],[]]
=> 2 = 3 - 1
[[[]],[[],[]]]
=> 2 = 3 - 1
[[[]],[[[]]]]
=> 3 = 4 - 1
[[[],[]],[],[]]
=> 2 = 3 - 1
[[[[]]],[],[]]
=> 3 = 4 - 1
[[[],[]],[[]]]
=> 2 = 3 - 1
[[[[]]],[[]]]
=> 3 = 4 - 1
[[[],[],[]],[]]
=> 2 = 3 - 1
[[[],[[]]],[]]
=> 3 = 4 - 1
[[[[]],[]],[]]
=> 3 = 4 - 1
[[[[],[]]],[]]
=> 3 = 4 - 1
[[[[[]]]],[]]
=> 4 = 5 - 1
Description
The depth minus 1 of an ordered tree.
The ordered trees of size $n$ are bijection with the Dyck paths of size $n-1$, and this statistic then corresponds to [[St000013]].
Matching statistic: St000528
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00047: Ordered trees —to poset⟶ Posets
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> ([(0,1)],2)
=> 2
[[],[]]
=> ([(0,2),(1,2)],3)
=> 2
[[[]]]
=> ([(0,2),(2,1)],3)
=> 3
[[],[],[]]
=> ([(0,3),(1,3),(2,3)],4)
=> 2
[[],[[]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 3
[[[]],[]]
=> ([(0,3),(1,2),(2,3)],4)
=> 3
[[[],[]]]
=> ([(0,3),(1,3),(3,2)],4)
=> 3
[[[[]]]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[[],[],[],[]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[[],[],[[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[],[[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[],[[],[]]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 3
[[],[[[]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> 4
[[[]],[],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[[]],[[]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> 3
[[[],[]],[]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 3
[[[[]]],[]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> 4
[[[],[],[]]]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 3
[[[],[[]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> 4
[[[[]],[]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> 4
[[[[],[]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 4
[[[[[]]]]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[[],[],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2
[[],[],[],[[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[],[[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[],[[],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[],[],[[[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[],[[]],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[[]],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[],[[],[]],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[],[[[]]],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[],[[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
=> 3
[[],[[],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[],[[[]],[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[],[[[],[]]]]
=> ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
=> 4
[[],[[[[]]]]]
=> ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
=> 5
[[[]],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[[]],[],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[],[]]]
=> ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[[]]]]
=> ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
=> 4
[[[],[]],[],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[[[]]],[],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[[],[]],[[]]]
=> ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[[]]],[[]]]
=> ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
=> 4
[[[],[],[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
=> 3
[[[],[[]]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[[[]],[]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[[[],[]]],[]]
=> ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
=> 4
[[[[[]]]],[]]
=> ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
=> 5
Description
The height of a poset.
This equals the rank of the poset [[St000080]] plus one.
Matching statistic: St001343
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00047: Ordered trees —to poset⟶ Posets
St001343: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001343: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> ([(0,1)],2)
=> 2
[[],[]]
=> ([(0,2),(1,2)],3)
=> 2
[[[]]]
=> ([(0,2),(2,1)],3)
=> 3
[[],[],[]]
=> ([(0,3),(1,3),(2,3)],4)
=> 2
[[],[[]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 3
[[[]],[]]
=> ([(0,3),(1,2),(2,3)],4)
=> 3
[[[],[]]]
=> ([(0,3),(1,3),(3,2)],4)
=> 3
[[[[]]]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[[],[],[],[]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[[],[],[[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[],[[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[],[[],[]]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 3
[[],[[[]]]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> 4
[[[]],[],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
[[[]],[[]]]
=> ([(0,3),(1,2),(2,4),(3,4)],5)
=> 3
[[[],[]],[]]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 3
[[[[]]],[]]
=> ([(0,4),(1,2),(2,3),(3,4)],5)
=> 4
[[[],[],[]]]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 3
[[[],[[]]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> 4
[[[[]],[]]]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> 4
[[[[],[]]]]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 4
[[[[[]]]]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[[],[],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2
[[],[],[],[[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[],[[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[],[[],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[],[],[[[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[],[[]],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[],[[]],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[],[[],[]],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[],[[[]]],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[],[[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
=> 3
[[],[[],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[],[[[]],[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[],[[[],[]]]]
=> ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
=> 4
[[],[[[[]]]]]
=> ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
=> 5
[[[]],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 3
[[[]],[],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[],[]]]
=> ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[]],[[[]]]]
=> ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
=> 4
[[[],[]],[],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 3
[[[[]]],[],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4
[[[],[]],[[]]]
=> ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
=> 3
[[[[]]],[[]]]
=> ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
=> 4
[[[],[],[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
=> 3
[[[],[[]]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[[[]],[]],[]]
=> ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 4
[[[[],[]]],[]]
=> ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
=> 4
[[[[[]]]],[]]
=> ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
=> 5
Description
The dimension of the reduced incidence algebra of a poset.
The reduced incidence algebra of a poset is the subalgebra of the incidence algebra consisting of the elements which assign the same value to any two intervals that are isomorphic to each other as posets.
Thus, this statistic returns the number of non-isomorphic intervals of the poset.
Matching statistic: St000013
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 1 = 2 - 1
[[],[]]
=> [1,0,1,0]
=> 1 = 2 - 1
[[[]]]
=> [1,1,0,0]
=> 2 = 3 - 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[[],[[]]]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[]]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[[[],[]]]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[[[[]]]]
=> [1,1,1,0,0,0]
=> 3 = 4 - 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3 = 4 - 1
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
Description
The height of a Dyck path.
The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000684
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 1 = 2 - 1
[[],[]]
=> [1,0,1,0]
=> 2 = 3 - 1
[[[]]]
=> [1,1,0,0]
=> 1 = 2 - 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> 3 = 4 - 1
[[],[[]]]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[]]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[[[],[]]]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[[[[]]]]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 3 = 4 - 1
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 5 - 1
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 4 - 1
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
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: St001203
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 1 = 2 - 1
[[],[]]
=> [1,0,1,0]
=> 2 = 3 - 1
[[[]]]
=> [1,1,0,0]
=> 1 = 2 - 1
[[],[],[]]
=> [1,0,1,0,1,0]
=> 3 = 4 - 1
[[],[[]]]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[[[]],[]]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[[[],[]]]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[[[[]]]]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 3 = 4 - 1
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 5 - 1
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 4 - 1
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 4 - 1
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 4 - 1
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
Description
We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
In the list $L$ delete the first entry $c_0$ and substract from all other entries $n-1$ and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra.
Example:
[5,6,6,6,6] goes into [2,2,2,2,1].
Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra.
The statistic return the global dimension of the CNakayama algebra divided by 2.
Matching statistic: St000306
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St000306: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000306: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 0 = 2 - 2
[[],[]]
=> [1,0,1,0]
=> 1 = 3 - 2
[[[]]]
=> [1,1,0,0]
=> 0 = 2 - 2
[[],[],[]]
=> [1,0,1,0,1,0]
=> 2 = 4 - 2
[[],[[]]]
=> [1,0,1,1,0,0]
=> 1 = 3 - 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> 1 = 3 - 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> 1 = 3 - 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> 0 = 2 - 2
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 1 = 3 - 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 1 = 3 - 2
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 3 - 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 1 = 3 - 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 6 - 2
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 5 - 2
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3 = 5 - 2
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3 = 5 - 2
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 4 - 2
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 5 - 2
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 4 - 2
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 4 - 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 4 - 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 4 - 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 3 - 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 3 - 2
Description
The bounce count of a Dyck path.
For a Dyck path $D$ of length $2n$, this is the number of points $(i,i)$ for $1 \leq i < n$ that are touching points of the [[Mp00099|bounce path]] of $D$.
Matching statistic: St001197
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St001197: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001197: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 0 = 2 - 2
[[],[]]
=> [1,0,1,0]
=> 1 = 3 - 2
[[[]]]
=> [1,1,0,0]
=> 0 = 2 - 2
[[],[],[]]
=> [1,0,1,0,1,0]
=> 2 = 4 - 2
[[],[[]]]
=> [1,0,1,1,0,0]
=> 1 = 3 - 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> 1 = 3 - 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> 1 = 3 - 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> 0 = 2 - 2
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 1 = 3 - 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 1 = 3 - 2
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 3 - 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 1 = 3 - 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 6 - 2
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 5 - 2
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3 = 5 - 2
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3 = 5 - 2
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 4 - 2
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 5 - 2
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 4 - 2
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 4 - 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 4 - 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 4 - 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 3 - 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 3 - 2
Description
The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
Matching statistic: St001506
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
St001506: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001506: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[]]
=> [1,0]
=> 0 = 2 - 2
[[],[]]
=> [1,0,1,0]
=> 1 = 3 - 2
[[[]]]
=> [1,1,0,0]
=> 0 = 2 - 2
[[],[],[]]
=> [1,0,1,0,1,0]
=> 2 = 4 - 2
[[],[[]]]
=> [1,0,1,1,0,0]
=> 1 = 3 - 2
[[[]],[]]
=> [1,1,0,0,1,0]
=> 1 = 3 - 2
[[[],[]]]
=> [1,1,0,1,0,0]
=> 1 = 3 - 2
[[[[]]]]
=> [1,1,1,0,0,0]
=> 0 = 2 - 2
[[],[],[],[]]
=> [1,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[],[],[[]]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[]],[]]
=> [1,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[]]]
=> [1,0,1,1,0,1,0,0]
=> 1 = 3 - 2
[[],[[[]]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[]],[],[]]
=> [1,1,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[]],[[]]]
=> [1,1,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[]],[]]
=> [1,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[]]],[]]
=> [1,1,1,0,0,0,1,0]
=> 1 = 3 - 2
[[[],[],[]]]
=> [1,1,0,1,0,1,0,0]
=> 2 = 4 - 2
[[[],[[]]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 3 - 2
[[[[]],[]]]
=> [1,1,1,0,0,1,0,0]
=> 1 = 3 - 2
[[[[],[]]]]
=> [1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[[[[[]]]]]
=> [1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[[],[],[],[],[]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 6 - 2
[[],[],[],[[]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 5 - 2
[[],[],[[]],[]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3 = 5 - 2
[[],[],[[],[]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[[],[],[[[]]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 4 - 2
[[],[[]],[],[]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[],[[]],[[]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[],[[],[]],[]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 5 - 2
[[],[[[]]],[]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[],[[],[],[]]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 4 - 2
[[],[[],[[]]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1 = 3 - 2
[[],[[[]],[]]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 3 - 2
[[],[[[],[]]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[[],[[[[]]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 3 - 2
[[[]],[],[],[]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 5 - 2
[[[]],[],[[]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 4 - 2
[[[]],[[]],[]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 4 - 2
[[[]],[[],[]]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 3 - 2
[[[]],[[[]]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 3 - 2
[[[],[]],[],[]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 5 - 2
[[[[]]],[],[]]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 4 - 2
[[[],[]],[[]]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 4 - 2
[[[[]]],[[]]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 3 - 2
[[[],[],[]],[]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[],[[]]],[]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[]],[]],[]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 4 - 2
[[[[],[]]],[]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 4 - 2
[[[[[]]]],[]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 3 - 2
Description
Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra.
The following 193 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000093The cardinality of a maximal independent set of vertices of a graph. St000147The largest part of an integer partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000308The height of the tree associated to a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000527The width of the poset. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. 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. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000053The number of valleys of the Dyck path. St000080The rank of the poset. St000141The maximum drop size of a permutation. St000662The staircase size of the code of a permutation. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000010The length of the partition. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000439The position of the first down step of a Dyck path. St000676The number of odd rises of a Dyck path. St000734The last entry in the first row of a standard tableau. St000808The number of up steps of the associated bargraph. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St001494The Alon-Tarsi number of a graph. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000007The number of saliances of the permutation. St000025The number of initial rises of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000056The decomposition (or block) number of a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000153The number of adjacent cycles of a permutation. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000167The number of leaves of an ordered tree. St000172The Grundy number of a graph. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000291The number of descents of a binary word. St000314The number of left-to-right-maxima of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000744The length of the path to the largest entry in a standard Young tableau. St000822The Hadwiger number of the graph. St000843The decomposition number of a perfect matching. St000877The depth of the binary word interpreted as a path. St000991The number of right-to-left minima of a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001058The breadth of the ordered tree. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001580The acyclic chromatic number of a graph. St001717The largest size of an interval in a poset. St001809The index of the step at the first peak of maximal height in a Dyck path. St001963The tree-depth of a graph. St000012The area of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000021The number of descents of a permutation. St000024The number of double up and double down steps of a Dyck path. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000052The number of valleys of a Dyck path not on the x-axis. St000155The number of exceedances (also excedences) of a permutation. St000224The sorting index of a permutation. St000234The number of global ascents of a permutation. St000237The number of small exceedances. St000245The number of ascents of a permutation. St000272The treewidth of a graph. St000292The number of ascents of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000536The pathwidth of a graph. St000546The number of global descents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000703The number of deficiencies of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. 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. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001277The degeneracy of a graph. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001358The largest degree of a regular subgraph of a graph. St001489The maximum of the number of descents and the number of inverse descents. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St001720The minimal length of a chain of small intervals in a lattice. St001820The size of the image of the pop stack sorting operator. St000061The number of nodes on the left branch of a binary tree. St000444The length of the maximal rise of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000925The number of topologically connected components of a set partition. St000083The number of left oriented leafs of a binary tree except the first one. St000216The absolute length of a permutation. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000730The maximal arc length of a set partition. St000809The reduced reflection length of the permutation. St000874The position of the last double rise in a Dyck path. St000957The number of Bruhat lower covers of a permutation. St000984The number of boxes below precisely one peak. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001480The number of simple summands of the module J^2/J^3. St001626The number of maximal proper sublattices of a lattice. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000907The number of maximal antichains of minimal length in a poset. St000159The number of distinct parts of the integer partition. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000392The length of the longest run of ones in a binary word. St001875The number of simple modules with projective dimension at most 1. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000259The diameter of a connected graph. St000260The radius of a connected graph. St001589The nesting number of a perfect matching. St000317The cycle descent number of a permutation. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000702The number of weak deficiencies of a permutation. St001590The crossing number of a perfect matching. St001674The number of vertices of the largest induced star graph in the graph. St000358The number of occurrences of the pattern 31-2. St000732The number of double deficiencies of a permutation. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001727The number of invisible inversions of a permutation. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001323The independence gap of a graph. St000264The girth of a graph, which is not a tree. St000143The largest repeated part of a partition. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000299The number of nonisomorphic vertex-induced subtrees. St000983The length of the longest alternating subword. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001578The minimal number of edges to add or remove to make a graph a line graph. St001712The number of natural descents of a standard Young tableau. St001960The number of descents of a permutation minus one if its first entry is not one. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the 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!