Leapfrog in Posets

Details Leapfrog in Posets Leapfrog in Posets

2011-08-04

arxiv.org/abs/1108.1124v1

Mathematics

Combinatorics

Scientific paper

We consider the following solitaire game whose rules are reminiscent of the children's game of leapfrog. The player is handed an arbitrary ordering $\pi=(x_1,x_2,...,x_n)$ of the elements of a finite poset $(P,\prec)$. At each round an element may "skip over" the element in front of it, i.e. swap positions with it. For example, if $x_i \prec x_{i+1}$, then it is allowed to move from $\pi$ to the ordering $(x_1,x_2,...,x_{i-1},x_{i+1},x_i,x_{i+2},...,x_n)$. 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 order of swaps matter for the final ordering or is it uniquely determined by the initial ordering? 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.

Affiliated with

Also associated with

No associations

Rating

Leapfrog in Posets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Leapfrog in Posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Leapfrog in Posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14823