• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Abacus-Tournament Models of Hall-Littlewood Polynomials

Wills, Andrew Johan 08 January 2016 (has links)
In this dissertation, we introduce combinatorial interpretations for three types of HallLittlewood polynomials (denoted Rλ, Pλ, and Qλ) by using weighted combinatorial objects called abacus-tournaments. We then apply these models to give combinatorial proofs of properties of Hall-Littlewood polynomials. For example, we show why various specializations of Hall-Littlewood polynomials produce the Schur symmetric polynomials, the elementary symmetric polynomials, or the t-analogue of factorials. With the abacus-tournament model, we give a bijective proof of a Pieri rule for Hall-Littlewood polynomials that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with an elementary symmetric polynomial ek. We also give a bijective proof of certain cases of a second Pieri rule that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with another Hall-Littlewood polynomial Q(r) . In general, proofs using abacus-tournaments focus on canceling abacus-tournaments and then finding weight-preserving bijections between the sets of uncanceled abacus-tournaments. / Ph. D.

Page generated in 0.0741 seconds