Identifier
-
Mp00132:
Dyck paths
—switch returns and last double rise⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St001431: Dyck paths ⟶ ℤ
Values
[1,0] => [1,0] => [1,1,0,0] => [1,0,1,0] => 0
[1,0,1,0] => [1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[1,1,0,0] => [1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 1
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[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,0] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 1
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 1
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 2
[1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 1
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path.
The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I.
See www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I.
See www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
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
swap returns and last descent
Description
Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!