The Kazhdan-Lusztig polynomial of a matroid M, denoted P_M( t ), was recently defined by Elias, Proudfoot, and Wakefield. These polynomials are analogous to the classical Kazhdan-Lusztig polynomials associated with Coxeter groups. For example, in both cases there is a purely combinatorial recursive definition. Furthermore, in the classical setting, if the Coxeter group is a Weyl group then the Kazhdan-Lusztig polynomial is a Poincare polynomial for the intersection cohomology of a particular variety; in the matroid setting, if M is a realizable matroid then the Kazhdan-Lusztig polynomial is also the intersection cohomology Poincare polynomial of a variety corresponding to M. (Though there are several analogies between the two types of polynomials, the theory is quite different.)
Here we compute the Kazhdan-Lusztig polynomials of several graphical matroids, including thagomizer graphs, the complete bipartite graph K_{2,n}, and (conjecturally) fan graphs. Additionally, we investigate a conjecture by the author, Proudfoot, and Young on the real-rootedness for Kazhdan-Lusztig polynomials of these matroids as well as a conjecture on the interlacing behavior of these roots. We also show that the Kazhdan-Lusztig polynomials of uniform matroids of rank n − 1 on n elements are real-rooted.
This dissertation includes both previously published and unpublished co-authored material.
| Identifer | oai:union.ndltd.org:uoregon.edu/oai:scholarsbank.uoregon.edu:1794/23913 |
| Date | 31 October 2018 |
| Creators | Gedeon, Katie |
| Contributors | Proudfoot, Nicholas |
| Publisher | University of Oregon |
| Source Sets | University of Oregon |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Rights | All Rights Reserved. |
Page generated in 0.0053 seconds