DescentBottomWord from Permutation
Letter v is 1 when value v is a descent bottom: some larger value immediately precedes it.
Value n is never a descent bottom, so the last letter stands for n - 1.
Called as CombinatorialMap(x, "DescentBottomWord"). The head's page has its examples.
Live
Explore
Each element of Permutation at a size, and its image, applied in your browser; sizes past 7 are not offered.
Properties
Transport a statistic
Pick a statistic on BinaryWord. Its distribution over the images of Permutation at each size is computed, and compared with the 323 statistics on Permutation: those that share it are the ones the map sends it to, as far as the sizes computed show.
FindStat Mp00131
descent bottoms
Matched by value: our map agrees with FindStat's image on each of the 873 rows of size at most 6 we can read (0 unread; its table has 1200 rows).
SurjectionGraded mapas FindStat records them, checked by FindStat's contributors.
| Object | Image |
|---|---|
[1] | |
[1,2] | 0 |
[2,1] | 1 |
[1,2,3] | 00 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00131 has the rest.