Back to search

Marshall University

The combinatorics of modified Macdonald polynomials

Abstract

dc:description.abstract

This paper is concerned with finding a combinatorial Schur expansion of the modified Macdonald polynomials. We will use the Robinson–Schensted–Knuth (RSK) algorithm to obtain the result for a limited set of partition shapes, and we will use Foata’s bijection to extend the result to conjugate shapes. We will explore possibilities for modifying the RSK algorithm in such a way that it could be applied to obtain the result for more general shapes.

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
  • Rodeheffer, Jacob
Contributors dc:contributor
  • Elizabeth Niese
  • JiYoon Jung
  • Carl Mummert

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://mds.marshall.edu/etd/1082

Chain of custody

source
Harvested from
Marshall University
Base URL
mds.marshall.edu/do/oai/
Last updated
2026-11-21
Source record
OAI-PMH GetRecord
citation

Rodeheffer, Jacob. The combinatorics of modified Macdonald polynomials. Thesis thesis, https://mds.marshall.edu/etd/1082