Lindzey, Nathan2018-12-202018-12-202018-12-202018-11-23http://hdl.handle.net/10012/14267In 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 problemenRepresentation TheoryExtremal CombinatoricsSymmetric FunctionsDoctoral Thesis