MathematicsSeminar |
|
Rocky Mountain Algebraic Combinatorics Seminar
A quasi-explanation of Babai's 'Graph isomorphism in Quasi-polynomial time'
James Wilson
Colorado State University
We give a report on the material steps in the recently reported breakthrough on the complexity of graph isomorphism. We also place the result into context and describe the importance of the split-or-Johnson theorem which underpins the recent algorithm. This talk will be accessible to students in computer science and mathematics.
The Exact Cover and Clique Finding Problems in Combinatorics
Anton Betten
Colorado State University
The problem of searching and classifying combinatorial objects can often be reduced to solving instances of the exact cover problem or the clique finding problem in graphs. We wish to present this technique in the context of the opportunistic and the systematic approach to finding and classifying combinatorial objects. As an application, we will look at regular packings in projective space.
Weber 223
4–6 pm
Friday, February 19, 2015
(Refreshments in Weber 117, 3:30–4 pm)
Colorado State University
This is a joint Denver U / UC Boulder / UC Denver / U of Wyoming / CSU seminar that meets biweekly. Anyone interested is welcome to join us at a local restaurant for dinner after the talks.
