Combinatorics of patience sorting piles
From MaRDI portal
Publication:2654575
zbMath1267.05005arXivmath/0506358MaRDI QIDQ2654575
Alexander Burstein, Isaiah Lankham
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0506358
set partitionsBell numbersgeneralized permutation patternspatience sortingbasic subsequencesleft-to-right minima subsequencesshadow diagrams
Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)
Related Items
Space-Efficient Algorithms for Longest Increasing Subsequence, Unnamed Item, Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns, The monoids of the patience sorting algorithm, Space-efficient algorithms for longest increasing subsequence, A geometric form for the extended patience sorting algorithm, Combinatorics of patience sorting monoids, Random matrix theory and its applications