When

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

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

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

Category

Colloquium

Speaker

Achill Schürmann(University of Rostock)

Abstract

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.

Where

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