MinimalDyckPath from IntegerPartition
The shortest Dyck path tracing the shape of the Ferrers diagram.
FindStat's Mp00043, Sage's partition to minimal Dyck word. Injective: the partition is the region above the path, and this is the shortest path whose region it is.
Called as CombinatorialMap(x, "MinimalDyckPath"). The head's page has its examples.
Live
Explore
Each element of IntegerPartition at a size, and its image, applied in your browser; sizes past 7 are not offered.
Properties
Transport a statistic
Pick a statistic on DyckPath. Its distribution over the images of IntegerPartition at each size is computed, and compared with the 165 statistics on IntegerPartition: those that share it are the ones the map sends it to, as far as the sizes computed show.
FindStat Mp00043
to Dyck path
Matched by value: our map agrees with FindStat's image on each of the 29 rows of size at most 6 we can read (0 unread; its table has 1200 rows).
Injectionas FindStat records them, checked by FindStat's contributors.
| Object | Image |
|---|---|
[1] | [1,0,1,0] |
[2] | [1,1,0,0,1,0] |
[3] | [1,1,1,0,0,0,1,0] |
[4] | [1,1,1,1,0,0,0,0,1,0] |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00043 has the rest.