Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 22, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Antoine Deza (McMaster University and Université Paris Sud)

On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs

We introduce a family of lattice polytopes, called primitive zonotopes, which can be seen as a generalization of the permutahedron. We discuss connections to the largest diameter of lattice polytopes and to the computational complexity of multicriteria matroid optimization. Tightening of the bounds for the largest possible diameter of a lattice polytope, complexity results, and open questions are presented. In particular, we answer a question raised in 1986 by Colbourn, Kocay, and Stinson by showing that deciding whether a given sequence is the degree sequence of a 3-hypergraph is computationally prohibitive. Based on joint works with Asaf Levin (Technion), George Manoussakis (Paris Sud), Syed Meesum (IMSc Chennai), Shmuel Onn (Technion), and Lionel Pounin (Paris XIII).


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login