A Linear Algebraic Method on the Chromatic Symmetric Function
| dc.contributor.author | Haithcock, Evan | |
| dc.date.accessioned | 2023-08-28T14:11:27Z | |
| dc.date.available | 2023-08-28T14:11:27Z | |
| dc.date.issued | 2023-08-28 | |
| dc.date.submitted | 2023-08-21 | |
| dc.description.abstract | The Stanley-Stembridge conjecture is a longstanding conjecture that has evaded proof for nearly 30 years. Concerned with the e-basis expansions of the chromatic symmetric functions of unit-interval graphs, this conjecture has served as a significant motivator of research in algebraic graph theory in recent years. We summarize a great deal of the existing work done in favor of this conjecture, giving an overview of the various techniques that have previously been used in the study of this problem. Moreover, we develop a novel technique using methods from linear algebra and use it to obtain an e-basis expansion of graphs known as single clique-blowups of paths. Using this same method, we use this result to prove the e-positivity of double clique-blowups of paths, a previously unknown result. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/19768 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.title | A Linear Algebraic Method on the Chromatic Symmetric Function | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.embargo.terms | 0 | en |
| uws.contributor.advisor | Crew, Logan | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |