Combinatorics of patience sorting monoids

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of tableaux, we present Robinson–Schensted–Knuth-type corresponden...

Full description

Bibliographic Details
Main Author: Cain, Alan J. (author)
Other Authors: Malheiro, António (author), Silva, Fábio M. (author)
Format: article
Language:eng
Published: 2019
Subjects:
Bell number
Hook-length formula
Patience sorting algorithm
Robinson–Schensted–Knuth correspondence
Theoretical Computer Science
Discrete Mathematics and Combinatorics
Online Access:https://doi.org/10.1016/j.disc.2019.05.022
Country:Portugal
Oai:oai:run.unl.pt:10362/75567

Internet

https://doi.org/10.1016/j.disc.2019.05.022

Similar Items