Valleys on DyckPath
Occurrences of a down step immediately followed by an up step.
Called as CombinatorialStat(x, "Valleys"). The head's page has its examples.
Live
Also on
The same name on other carriers, each its own implementation: Permutation.
FindStat St000053
The number of valleys of the Dyck path.
| Object | Value |
|---|---|
[1,0] | 0 |
[1,0,1,0] | 1 |
[1,1,0,0] | 0 |
[1,0,1,0,1,0] | 2 |
[1,0,1,1,0,0] | 1 |
[1,1,0,0,1,0] | 1 |
[1,1,0,1,0,0] | 1 |
[1,1,1,0,0,0] | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000053 has the rest.
FindStat St001169
The number of simple modules with projective dimension at least two of the linear Nakayama algebra corresponding to a Dyck path.
| Object | Value |
|---|---|
[1,0] | 0 |
[1,0,1,0] | 1 |
[1,1,0,0] | 0 |
[1,0,1,0,1,0] | 2 |
[1,0,1,1,0,0] | 1 |
[1,1,0,0,1,0] | 1 |
[1,1,0,1,0,0] | 1 |
[1,1,1,0,0,0] | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001169 has the rest.