Patience Sorting and Its Generalizations
Isaiah Lankham
TL;DR
This dissertation reviews Patience Sorting and its generalizations, consolidating existing results and introducing new findings to advance understanding of these combinatorial algorithms.
Contribution
It compiles and extends prior research on Patience Sorting, including unpublished results, providing a comprehensive overview and new insights into its generalizations.
Findings
Incorporates multiple prior results on Patience Sorting
Introduces previously unpublished results in the field
Provides a unified framework for understanding generalizations
Abstract
This dissertation collects together results on Patience Sorting and its generalizations. It incorporates the results of math.CO/0506358, math.CO/0507031, and math.CO/0512122, as well as previously unpublished results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Random Matrices and Applications · Bayesian Methods and Mixture Models