Codes and Expansions (CodEx) Seminar
Nathan Lindzey (University of Colorado Boulder)
Discrete Harmonic Analysis on Matchings
We give an overview of discrete harmonic analysis on finite homogeneous spaces and Gelfand pairs associated with matchings of graphs (sets of disjoint edges). Along the way, we demonstrate how this perspective allows one to tackle a variety of problems involving matchings that arise in combinatorics and theoretical computer science.