Restricted Patience Sorting and Barred Pattern Avoidance
| dc.creator | Burstein, Alexander | |
| dc.creator | Lankham, Isaiah | |
| dc.date | 2005-12-06 | |
| dc.date | 2006-03-06 | |
| dc.date.accessioned | 2026-07-07T06:54:54Z | |
| dc.date.available | 2026-07-07T06:54:54Z | |
| dc.description | 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 have shown that Patience Sorting provides an algorithmic description for permutations avoiding the barred (generalized) permutation pattern $3-\bar{1}-42$. Motivated by this and a recently formulated geometric form for Patience Sorting in terms of certain intersecting lattice paths, we study the related themes of restricted input and avoidance of similar barred permutation patterns. One such result is to characterize those permutations for which Patience Sorting is an invertible algorithm as the set of permutations simultaneously avoiding the barred patterns $3-\bar{1}-42$ and $3-\bar{1}-24$. We then enumerate this avoidance set, which involves convolved Fibonacci numbers. | |
| dc.description | 12 pages, LaTeX, uses pstricks, needs fpsac.cls v2: final version of extended abstract for FPSAC'06 | |
| dc.identifier | https://arxiv.org/abs/math/0512122 | |
| dc.identifier | http://arxiv.org/abs/math/0512122 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106106 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05, 05A15, 05A18 (Primary); 05E10 (Secondary) | |
| dc.title | Restricted Patience Sorting and Barred Pattern Avoidance | |
| dc.type | text |