Matchings and Representation Theory
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
Collections
Cite this version of the work
Nathan Lindzey
(2018).
Matchings and Representation Theory. UWSpace.
http://hdl.handle.net/10012/14267
Other formats