__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

03/30/2010 - 12:15pm

03/30/2010 - 1:10pm

Speaker:

Mark Huber (Claremont McKenna College)

Abstract:

Finding the determinant of a matrix is made easy by taking advantage of invariants arising from its geometric nature. The permanent slightly tweaks the formula for the determinant, but changes it into a combinatorial entity, making calculation far more difficult. Finding the permanent of a matrix, even when all the entries of the matrix are 0 or 1, is a #P complete problem. Still, all is not lost, as there are upper bounds like Minc's inequality, and lower bounds like Van der Waerden's Inequality. I will show how these two inequalities can be effectively used to construct a Monte Carlo algorithm for approximating the permanent. The permanent is related to counting perfect matchings in a bipartite graph, and this algorithm gives the first method for exact uniform simulation of perfect matchings for a nontrivial class of bipartite graphs.

Where:

Millikan 208 (Pomona College)