Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St000689: Dyck paths ⟶ ℤ
Values
[1,0,1,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,0,1,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,0,1,1,0,0] => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
[1,1,0,0,1,0] => [2] => [1,0,1,0] => [1,0,1,0] => 1
[1,1,0,1,0,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,0,1,0,1,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,0,1,0,1,1,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 0
[1,0,1,1,0,0,1,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,0,1,1,0,1,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 0
[1,1,0,0,1,0,1,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,0,0,1,1,0,0] => [2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => 0
[1,1,0,1,0,0,1,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => 1
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,0,1,1,0,0,0] => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
[1,1,1,0,0,0,1,0] => [3] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 2
[1,1,1,0,0,1,0,0] => [2] => [1,0,1,0] => [1,0,1,0] => 1
[1,1,1,0,1,0,0,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 0
[1,1,0,0,1,0,1,1,0,0] => [3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,0,0,1,1,0,1,0,0] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,0,0,1,1,1,0,0,0] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,1,0,0] => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 0
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 0
[1,1,1,0,0,0,1,0,1,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,1,0,0,0,1,1,0,0] => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,0,0,1,0,0,1,0] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => 1
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
[1,1,1,1,0,0,0,0,1,0] => [4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,1,0,0,0,1,0,0] => [3] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 2
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,0,1,0] => [1,0,1,0] => 1
[1,1,1,1,0,1,0,0,0,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 0
[1,1,0,0,1,1,1,1,0,0,0,0] => [2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,1,1,1,0,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,0,1,1,0,1,1,0,0,0,0] => [2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 0
[1,1,1,0,0,0,1,1,1,0,0,0] => [3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,1,1,0,0,1,0,1,1,0,0,0] => [3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,1,0,0,1,1,0,1,0,0,0] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,1,0,0,1,1,1,0,0,0,0] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,1,1,0,1,0,0,1,1,0,0,0] => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 0
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,0,1,1,0,0] => [4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,1,1,1,0,0,0,1,0,1,0,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,1,1,0,0,0,1,1,0,0,0] => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,1,0,0,1,0,0,1,0,0] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => 0
[1,1,1,1,0,1,0,0,0,1,0,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
[1,1,1,1,0,1,0,0,1,0,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
[1,1,1,1,1,0,0,0,0,0,1,0] => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 4
[1,1,1,1,1,0,0,0,0,1,0,0] => [4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,1,1,0,0,0,1,0,0,0] => [3] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 2
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,0,1,0] => [1,0,1,0] => 1
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [1,0] => [1,0] => 0
[1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 0
[1,1,1,0,0,1,1,1,1,0,0,0,0,0] => [2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,1,0,1,1,0,1,1,0,0,0,0,0] => [2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,1,1,1,0,0,0,0] => [3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,1,1,1,0,0,1,0,1,1,0,0,0,0] => [3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,1,1,0,0,1,1,0,1,0,0,0,0] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,1,1,0,0,1,1,1,0,0,0,0,0] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,1,1,1,0,1,0,0,1,1,0,0,0,0] => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 0
[1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 0
[1,1,1,1,1,0,0,0,0,1,1,0,0,0] => [4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,1,1,1,1,0,0,0,1,0,1,0,0,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,1,1,1,0,0,0,1,1,0,0,0,0] => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => 0
[1,1,1,1,1,0,1,0,0,0,1,0,0,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
[1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => 1
[1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
>>> Load all 207 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid.
The correspondence between LNakayama algebras and Dyck paths is explained in St000684The global dimension of the LNakayama algebra associated to a Dyck path.. A module $M$ is $n$-rigid, if $\operatorname{Ext}^i(M,M)=0$ for $1\leq i\leq n$.
This statistic gives the maximal $n$ such that the minimal generator-cogenerator module $A \oplus D(A)$ of the LNakayama algebra $A$ corresponding to a Dyck path is $n$-rigid.
An application is to check for maximal $n$-orthogonal objects in the module category in the sense of [2].
The correspondence between LNakayama algebras and Dyck paths is explained in St000684The global dimension of the LNakayama algebra associated to a Dyck path.. A module $M$ is $n$-rigid, if $\operatorname{Ext}^i(M,M)=0$ for $1\leq i\leq n$.
This statistic gives the maximal $n$ such that the minimal generator-cogenerator module $A \oplus D(A)$ of the LNakayama algebra $A$ corresponding to a Dyck path is $n$-rigid.
An application is to check for maximal $n$-orthogonal objects in the module category in the sense of [2].
Map
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
searching the database
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!