## Abstract

We consider the following solitaire game whose rules are reminiscent of the children's game of leapfrog. The game is played on a poset (P, ≺) with n elements. The player is handed an arbitrary permutation π=(x _{1}, x _{2}, . . ., x _{n}) of the elements in P. At each round an element may "skip over" a smaller element preceding it, i.e. swap positions with it. For example, if x _{i}≺x _{i+1}, then it is allowed to move from π to the permutation (x _{1}, x _{2}, . . ., x _{i-1}, x _{i+1}, x _{i}, x _{i+2}, . . ., x _{n}) of P's elements. The player is to carry out such steps as long as such swaps are possible. When there are several consecutive pairs of elements that satisfy this condition, the player can choose which pair to swap next. Does the player's choice of swaps matter for the final permutation or is it uniquely determined by the initial order of P's elements? The reader may guess correctly that the latter proposition is correct. What may be more surprising, perhaps, is that this question is not trivial. The proof works by constructing an appropriate system of invariants.

Original language | American English |
---|---|

Pages (from-to) | 1299-1301 |

Number of pages | 3 |

Journal | Journal of Combinatorial Theory. Series A |

Volume | 119 |

Issue number | 6 |

DOIs | |

State | Published - Aug 2012 |

## Keywords

- Order
- Poset
- Strong convergence