Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux
Description:
In this thesis, we describe Schensted's algorithm for finding the length of a longest increasing subsequence of a finite sequence. Schensted's algorithm also constructs a bijection between permutations of the first N natural numbers and standard bitableaux of size N. We also describe the Hillman-Grassl algorithm which constructs a bijection between reverse plane partitions and the solutions in natural numbers of a linear equation involving hook lengths. Pascal programs and sample output for bot…
more
Date:
August 1983
Creator:
Sutherland, David C. (David Craig)
Partner:
UNT Libraries