Skip to content

Rowmotion from BinaryWord ​

Rowmotion of the word as an order ideal of a product of two chains: the stretches between valleys reversed, each valley written 10.

BinaryWord → BinaryWordbijection

FindStat's Mp00278. A bijection that keeps the number of ones; its order is the length of the word.

Called as CombinatorialMap(x, "Rowmotion"). The head's page has its examples.

Live

Explore

Each element of BinaryWord at a size, and its image, applied in your browser; sizes past 6 are not offered.

Properties

Transport a statistic

Pick a statistic on BinaryWord. Its distribution over the images of BinaryWord at each size is computed, and compared with the 59 statistics on BinaryWord: those that share it are the ones the map sends it to, as far as the sizes computed show.

Also from

The same name out of other carriers, each its own implementation: SignedPermutation.

FindStat Mp00278

rowmotion

Matched by value: our map agrees with FindStat's image on each of the 126 rows of size at most 6 we can read (0 unread; its table has 1200 rows).

BijectionGraded mapas FindStat records them, checked by FindStat's contributors.

Return the rowmotion of the binary word, regarded as an order ideal in the product of two chains.
ObjectImage
00
11
0000
0110

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00278 has the rest.