Strong convergence in posets

From MaRDI portal




Abstract: 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=(x1,x2,...,xn) 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 xiprecxi+1, then it is allowed to move from pi to the ordering (x1,x2,...,xi1,xi+1,xi,xi+2,...,xn). 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.









This page was built for publication: Strong convergence in posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423649)