Exploiting Symmetries in Computations with Lattice Polytopes

Start: 12/06/2017 - 4:15pm
End  : 12/06/2017 - 5:15pm


Achill Schürmann(University of Rostock)

Exploiting symmetry in integer linear programming and lattice
point counting are two difficult problems for which no good general
approach exists. In fact, standard techniques work particularly poor
on symmetric problems. In this talk we give an overview about ongoing
work on new symmetry exploiting techniques for these two fundamental 
problem classes involving lattice polytopes. We in particular present 
some new ideas of decomposing lattice polytopes and give some initial 
proof-of-concept results applying these new techniques.
Argue Auditorium, Millikan, Pomona College

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences