Mathematics – Combinatorics
Scientific paper
2005-07-02
Mathematics
Combinatorics
14 pages, LaTeX, uses pstricks; v2: major revision after section 3; to be published in Adv. Appl. Math
Scientific paper
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patience Sorting to a full bijection between the symmetric group and certain pairs of combinatorial objects (called pile configurations) that are most naturally defined in terms of generalized permutation pattern and barred pattern avoidance. This Extended Patience Sorting Algorithm is very similar to the Robinson-Schensted-Knuth (or RSK) Correspondence, which is itself built from repeated application of the Schensted Insertion Algorithm. In this work we introduce a geometric form for the Extended Patience Sorting Algorithm that is in some sense a natural dual algorithm to G. Viennot's celebrated Geometric RSK Algorithm. Unlike Geometric RSK, though, the lattice paths coming from Patience Sorting are allowed to intersect. We thus also give a characterization for the intersections of these lattice paths in terms of the pile configurations associated with a given permutation under the Extended Patience Sorting Algorithm.
Burstein Alexander
Lankham Isaiah
No associations
LandOfFree
A Geometric Form for the Extended Patience Sorting Algorithm 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 A Geometric Form for the Extended Patience Sorting Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Geometric Form for the Extended Patience Sorting Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-497370