SimplesOfGradeAtLeastThree on DyckPath
The simple modules of grade at least three.
FindStat's St001186.
Called as CombinatorialStat(x, "SimplesOfGradeAtLeastThree"). The head's page has its examples.
Live
Distribution
Over DyckPaths at each size, tallied here in your browser; sizes past 10 are not offered.
FindStat St001186
The number of simple modules of grade at least three in the linear Nakayama algebra corresponding to a Dyck path.
| Object | Value |
|---|---|
[1,0] | 0 |
[1,0,1,0] | 0 |
[1,1,0,0] | 0 |
[1,0,1,0,1,0] | 1 |
[1,0,1,1,0,0] | 0 |
[1,1,0,0,1,0] | 0 |
[1,1,0,1,0,0] | 0 |
[1,1,1,0,0,0] | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001186 has the rest.