Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

The DFT and Perfect Matchings in Bipartite Graphs
by
Timothy M. Brauch
University of Louisville
Coauthors: Andre E. Kezdy, University of Louisville Hunter S. Snevily, University of Idaho

This talk will provide recent results using a "Combinatorial Nullstellensatz" approach to detecting perfect matchings in bipartite graphs. This leads naturally to a simple circular lock problem that encapsulates the relationship between this problem and the discrete Fourier transformation of this problem, detecting a maximum rank independent set in the intersection of two special types of matroids. An application of the uncertainity principle yields a bound on the product of the number of such independence sets and the number of perfect matchings.

Date received: April 18, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-46.