Degree Sequence Optimization and Sparse Integer Programming

  • Shmuel Onn (Technion, Haifa)
G3 10 (Lecture hall)


I will discuss the fundamental problem of degree sequence optimization and its special case of matrix line sum optimization, which are wide open. I will suggest some of the many open problems, describe some partial results such as for convex polynomials, and show some of the techniques used, including our recent powerful theory of sparse integer programming in high dimensions, which will be explained.

Mirke Olschewski

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of this Seminar