Abstract
dc:description.abstractThe Knuth transformations on words, the jeu de taquin moves on tableaux, and the Robinson–Schensted–Knuth algorithm produce the same equivalence classes for words. By observing the connections between these three methods we find and prove there exists connections between the Assaf–Knuth transformations, our extension of the jeu de taquin, and p-RSK. We know there exists an algebraic way to expand Macdonald polynomials in terms of the Schur functions. The form of the expansion implies there should be a combinatorial way to find the expansion. Loehr found a Robinson–Schensted–Knuth like algorithm that works in some cases. By finding an extension of jeu de taquin, we will try to expand the number of cases covered.
Degree
thesis:*- Name thesis:degree_name
- Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- College of Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- McKinney, Joanna
- Contributors dc:contributor
-
- Dr. Elizabeth Niese, Committee Chairperson
- Dr. JiYoon Jung
- Dr. Carl Mummert
Subjects
dc:subject × 4Identifiers
dc:identifier.*- Repository record dc:identifier
- https://mds.marshall.edu/etd/1189