searching the database
Your data matches 25 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: St001553
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001553: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001553: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> 0
([(1,2)],3)
=> [1]
=> [1,0]
=> 0
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(2,3)],4)
=> [1]
=> [1,0]
=> 0
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(3,4)],5)
=> [1]
=> [1,0]
=> 0
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(4,5)],6)
=> [1]
=> [1,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
Description
The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path.
The statistic returns zero in case that bimodule is the zero module.
Matching statistic: St000306
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000306: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000306: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
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
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001197: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001197: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
Description
The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
Matching statistic: St001205
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001205: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001205: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
Description
The 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$.
See http://www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Nakayama algebra and the relation to Dyck paths.
Matching statistic: St001506
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001506: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001506: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
Description
Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra.
Matching statistic: St000686
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
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: St001201
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001201: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001201: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
Description
The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path.
Matching statistic: St001203
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 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: St001028
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001028: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001028: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 2 = 0 + 2
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 2 = 0 + 2
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2 = 0 + 2
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 2 = 0 + 2
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2 = 0 + 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 1 + 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2 = 0 + 2
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 2 = 0 + 2
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2 = 0 + 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 1 + 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 2 + 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 3 = 1 + 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2 = 0 + 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 1 + 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 2 + 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 1 + 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2 = 0 + 2
([(4,5)],6)
=> [1]
=> [1,0]
=> [1,0]
=> 2 = 0 + 2
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 6 = 4 + 2
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 1 + 2
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 2 + 2
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2 = 0 + 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 1 + 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 6 = 4 + 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 2 + 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 3 = 1 + 2
Description
Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001462
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St001462: Standard tableaux ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St001462: Standard tableaux ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [[1]]
=> [[1]]
=> 1 = 0 + 1
([(1,2)],3)
=> [1]
=> [[1]]
=> [[1]]
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 1 = 0 + 1
([(2,3)],4)
=> [1]
=> [[1]]
=> [[1]]
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [[1,2,3],[4]]
=> [[1,4],[2],[3]]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 1 = 0 + 1
([(3,4)],5)
=> [1]
=> [[1]]
=> [[1]]
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [[1,2,3],[4]]
=> [[1,4],[2],[3]]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [[1,4,5],[2],[3]]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [[1,5],[2],[3],[4]]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [[1,4,5],[2],[3]]
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [[1,2,3],[4]]
=> [[1,4],[2],[3]]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [[1,4,5],[2],[3]]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> [[1,4],[2,5],[3,6]]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 1 = 0 + 1
([(4,5)],6)
=> [1]
=> [[1]]
=> [[1]]
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,2,3,4,5]]
=> 5 = 4 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3 = 2 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [[1,2,3],[4]]
=> [[1,4],[2],[3]]
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,2,3,4,5]]
=> 5 = 4 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [[1,4,5],[2],[3]]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4 = 3 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [[1,5],[2],[3],[4]]
=> 2 = 1 + 1
([(0,5),(0,6),(1,4),(1,6),(2,3),(2,6),(3,6),(4,6),(5,6)],7)
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> [[1,4,7],[2,5,8],[3,6,9]]
=> ? = 1 + 1
([(0,1),(0,6),(1,6),(2,3),(2,5),(3,5),(4,5),(4,6),(5,6)],7)
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> [[1,4,7],[2,5,8],[3,6,9]]
=> ? = 1 + 1
Description
The number of factors of a standard tableaux under concatenation.
The concatenation of two standard Young tableaux $T_1$ and $T_2$ is obtained by adding the largest entry of $T_1$ to each entry of $T_2$, and then appending the rows of the result to $T_1$, see [1, dfn 2.10].
This statistic returns the maximal number of standard tableaux such that their concatenation is the given tableau.
The following 15 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001622The number of join-irreducible elements of a lattice. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St000640The rank of the largest boolean interval in a poset. St001877Number of indecomposable injective modules with projective dimension 2. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001875The number of simple modules with projective dimension at most 1.
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!