searching the database
Your data matches 1 statistic 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: St000684
Mp00233: Dyck paths —skew partition⟶ Skew partitions
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0,1,0]
=> [[2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [[2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [[2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [[3,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [[3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [[3,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [[2,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [[4,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[4,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [[4,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [[4,4],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [[4,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [[3,3,3],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[4,4],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [[2,2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [[3,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [[3,3,2],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,0,0,1,1,0,0,0]
=> [[3,3,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [[2,2,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [[3,3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,1,0,0,1,0,0,0]
=> [[3,3,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[4,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3,1],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[4,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[4,4,1],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [[4,4,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [[4,3,1],[1]]
=> [1]
=> [1,0]
=> 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.
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!