Asset Details
Do you wish to reserve the book?
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Do you wish to request the book?
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
2015
Overview
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley's process, and investigate its expected value on a random permutation. In contrast with the (well studied) case of the longest increasing subsequence, we bring experimental evidence that the correct asymptotic scaling is \\(1+52 (n)\\). Finally we give a heap-based extension of Young tableaux, prove a hook inequality and an extension of the Robinson-Schensted correspondence.
Publisher
Cornell University Library, arXiv.org
Subject
