Matchings and Representation Theory
| dc.contributor.author | Lindzey, Nathan | |
| dc.date.accessioned | 2018-12-20T14:45:01Z | |
| dc.date.available | 2018-12-20T14:45:01Z | |
| dc.date.issued | 2018-12-20 | |
| dc.date.submitted | 2018-11-23 | |
| dc.description.abstract | In this thesis we investigate the algebraic properties of matchings via representation theory. We identify three scenarios in different areas of combinatorial mathematics where the algebraic structure of matchings gives keen insight into the combinatorial problem at hand. In particular, we prove tight conditional lower bounds on the computational complexity of counting Hamiltonian cycles, resolve an asymptotic version of a conjecture of Godsil and Meagher in Erdos-Ko-Rado combinatorics, and shed light on the algebraic structure of symmetric semidefinite relaxations of the perfect matching problem | en |
| dc.identifier.uri | http://hdl.handle.net/10012/14267 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | Representation Theory | en |
| dc.subject | Extremal Combinatorics | en |
| dc.subject | Symmetric Functions | en |
| dc.title | Matchings and Representation Theory | en |
| dc.type | Doctoral Thesis | en |
| uws-etd.degree | Doctor of Philosophy | 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.contributor.advisor | Cheriyan, Joseph | |
| uws.contributor.advisor | Godsil, Chris | |
| 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 |