Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000689: Dyck paths ⟶ ℤ
Values
[1,0,1,0] => [1] => [1] => [1,0,1,0] => 1
[1,0,1,0,1,0] => [2,1] => [3] => [1,1,1,0,0,0,1,0] => 0
[1,0,1,1,0,0] => [1,1] => [1,1] => [1,0,1,1,0,0] => 0
[1,1,0,0,1,0] => [2] => [2] => [1,1,0,0,1,0] => 0
[1,1,0,1,0,0] => [1] => [1] => [1,0,1,0] => 1
[1,0,1,0,1,0,1,0] => [3,2,1] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,0,1,1,0,0,1,0] => [3,1,1] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,0,1,1,0,1,0,0] => [2,1,1] => [3,1] => [1,1,0,1,0,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,1] => [1,1,1] => [1,0,1,1,1,0,0,0] => 0
[1,1,0,0,1,0,1,0] => [3,2] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,0,0,1,1,0,0] => [2,2] => [4] => [1,1,1,1,0,0,0,0,1,0] => 0
[1,1,0,1,0,0,1,0] => [3,1] => [2,1,1] => [1,0,1,1,0,1,0,0] => 1
[1,1,0,1,0,1,0,0] => [2,1] => [3] => [1,1,1,0,0,0,1,0] => 0
[1,1,0,1,1,0,0,0] => [1,1] => [1,1] => [1,0,1,1,0,0] => 0
[1,1,1,0,0,0,1,0] => [3] => [2,1] => [1,0,1,0,1,0] => 2
[1,1,1,0,0,1,0,0] => [2] => [2] => [1,1,0,0,1,0] => 0
[1,1,1,0,1,0,0,0] => [1] => [1] => [1,0,1,0] => 1
[1,0,1,1,0,1,0,1,0,0] => [3,2,1,1] => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => 0
[1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => 0
[1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => [3,1,1] => [1,0,1,1,0,0,1,0] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,0,1,0] => [4,3,1] => [4,3,1] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,0,1,0,0,1,1,0,0] => [3,3,1] => [3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,0,1,1,0,0,0,1,0] => [4,1,1] => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => 0
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [3,1] => [1,1,0,1,0,0,1,0] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [1,1,1] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,0,0,0,1,0,1,0] => [4,3] => [4,3] => [1,1,1,0,0,0,1,0,1,0] => 0
[1,1,1,0,0,0,1,1,0,0] => [3,3] => [3,2,1] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,0,0,1,0,0,1,0] => [4,2] => [4,2] => [1,1,1,0,0,1,0,0,1,0] => 0
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [4] => [1,1,1,1,0,0,0,0,1,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [4,1] => [3,2] => [1,1,0,0,1,0,1,0] => 0
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [2,1,1] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [3] => [1,1,1,0,0,0,1,0] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,1] => [1,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,0,1,0] => [4] => [2,2] => [1,1,0,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,1,0,0] => [3] => [2,1] => [1,0,1,0,1,0] => 2
[1,1,1,1,0,0,1,0,0,0] => [2] => [2] => [1,1,0,0,1,0] => 0
[1,1,1,1,0,1,0,0,0,0] => [1] => [1] => [1,0,1,0] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [3,2,1,1,1] => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,0,1,1,1,1,0,1,0,0,0,0] => [2,1,1,1,1] => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,0,1,1,0,1,0,0,0,1,0] => [5,2,1,1] => [4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => 0
[1,1,0,1,1,0,1,0,1,0,0,0] => [3,2,1,1] => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => 0
[1,1,0,1,1,1,0,0,0,1,0,0] => [4,1,1,1] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => 0
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => [3,1,1] => [1,0,1,1,0,0,1,0] => 0
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,1,0,0,0,1,1,1,0,0,0] => [3,3,3] => [3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => 0
[1,1,1,0,1,0,0,1,0,1,0,0] => [4,3,1] => [4,3,1] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,0,1,0,0,1,1,0,0,0] => [3,3,1] => [3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,1,0,1,0,1,0,0,0,1,0] => [5,2,1] => [3,3,2] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,1,0,1,1,0,0,0,1,0,0] => [4,1,1] => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => 0
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [3,1] => [1,1,0,1,0,0,1,0] => 1
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,1,1] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,1,0,0,0,1,0,0,1,0] => [5,3] => [3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,1,1,1,0,0,0,1,0,1,0,0] => [4,3] => [4,3] => [1,1,1,0,0,0,1,0,1,0] => 0
[1,1,1,1,0,0,0,1,1,0,0,0] => [3,3] => [3,2,1] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,1,0,0,1,0,0,0,1,0] => [5,2] => [4,2,1] => [1,1,0,1,0,1,0,0,1,0] => 1
[1,1,1,1,0,0,1,0,0,1,0,0] => [4,2] => [4,2] => [1,1,1,0,0,1,0,0,1,0] => 0
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [4] => [1,1,1,1,0,0,0,0,1,0] => 0
[1,1,1,1,0,1,0,0,0,0,1,0] => [5,1] => [2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => 0
[1,1,1,1,0,1,0,0,0,1,0,0] => [4,1] => [3,2] => [1,1,0,0,1,0,1,0] => 0
[1,1,1,1,0,1,0,0,1,0,0,0] => [3,1] => [2,1,1] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [3] => [1,1,1,0,0,0,1,0] => 0
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,1] => [1,0,1,1,0,0] => 0
[1,1,1,1,1,0,0,0,0,0,1,0] => [5] => [2,2,1] => [1,0,1,0,1,1,0,0] => 0
[1,1,1,1,1,0,0,0,0,1,0,0] => [4] => [2,2] => [1,1,0,0,1,1,0,0] => 0
[1,1,1,1,1,0,0,0,1,0,0,0] => [3] => [2,1] => [1,0,1,0,1,0] => 2
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [2] => [1,1,0,0,1,0] => 0
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [1] => [1,0,1,0] => 1
[1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1,1] => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1,1] => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,1,0,1,1,0,1,0,0,0,1,0,0] => [5,2,1,1] => [4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => 0
[1,1,1,0,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1] => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => 0
[1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [4,1,1,1] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => 0
[1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1] => [3,1,1] => [1,0,1,1,0,0,1,0] => 0
[1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,1,1,0,0,0,1,1,1,0,0,0,0] => [3,3,3] => [3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => 0
[1,1,1,1,0,1,0,0,1,0,1,0,0,0] => [4,3,1] => [4,3,1] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,1,0,1,0,0,1,1,0,0,0,0] => [3,3,1] => [3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,1,1,0,1,0,1,0,0,0,1,0,0] => [5,2,1] => [3,3,2] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,1,1,0,1,1,0,0,0,0,0,1,0] => [6,1,1] => [4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,1,1,1,0,1,1,0,0,0,1,0,0,0] => [4,1,1] => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => 0
[1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [3,1,1] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,1,1] => [3,1] => [1,1,0,1,0,0,1,0] => 1
[1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,1,1] => [1,1,1] => [1,0,1,1,1,0,0,0] => 0
[1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [5,5] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 4
[1,1,1,1,1,0,0,0,1,0,0,0,1,0] => [6,3] => [4,3,2] => [1,1,0,0,1,0,1,0,1,0] => 0
[1,1,1,1,1,0,0,0,1,0,0,1,0,0] => [5,3] => [3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,1,1,1,1,0,0,0,1,0,1,0,0,0] => [4,3] => [4,3] => [1,1,1,0,0,0,1,0,1,0] => 0
[1,1,1,1,1,0,0,0,1,1,0,0,0,0] => [3,3] => [3,2,1] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,1,1,0,0,1,0,0,0,0,1,0] => [6,2] => [4,2,2] => [1,1,0,0,1,1,0,0,1,0] => 0
[1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [5,2] => [4,2,1] => [1,1,0,1,0,1,0,0,1,0] => 1
[1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [4,2] => [4,2] => [1,1,1,0,0,1,0,0,1,0] => 0
[1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [3,2] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [2,2] => [4] => [1,1,1,1,0,0,0,0,1,0] => 0
>>> Load all 233 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 Exti(M,M)=0 for 1≤i≤n.
This statistic gives the maximal n such that the minimal generator-cogenerator module A⊕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 Exti(M,M)=0 for 1≤i≤n.
This statistic gives the maximal n such that the minimal generator-cogenerator module A⊕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
2-conjugate
Description
Return a partition with the same number of odd parts and number of even parts interchanged with the number of cells with zero leg and odd arm length.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by s and interchanges the number of parts divisible by s and the number of cells with zero leg length and arm length congruent to s−1 modulo s.
In particular, for s=1 the involution is conjugation, hence the name.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by s and interchanges the number of parts divisible by s and the number of cells with zero leg length and arm length congruent to s−1 modulo s.
In particular, for s=1 the involution is conjugation, hence the name.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λ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,…,2,1).
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λ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,…,2,1).
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!