Skip to content

ToricPromotion ​

Toric promotion of the path graph: swap the values 1 and 2, then 2 and 3, and so on up to n and 1, each swap skipped when the two values sit next to each other.

ToricPromotion(Permutation)Toric promotion of the path graph: swap the values 1 and 2, then 2 and 3, and so on up to n and 1, each swap skipped when the two values sit next to each other.
Typed signatures
TypePackageApplies
(permutation) -> permutationcombinatoricsalways

Domain: Combinatorial maps

Details
  • Takes a Permutation and returns a Permutation — a typed map, so a wrong carrier is a type error rather than a wrong answer.
  • FindStat's Mp00310. Its order is n - 1; the inverse is InverseToricPromotion.

Examples

Basic #

the one-line word 231231

live ↗
InToricPromotion(Permutation⁡([2,3,1]))\mathrm{ToricPromotion}({\operatorname{Permutation}}([2, 3, 1]))OutPermutation⁡([1,3,2]){\operatorname{Permutation}}([1, 3, 2])
About
Examples1
CrosswalkFindStat