Seminar: Submodular functions and convexity

Summer Semester 2012

Raman Sanyal, Arnimallee 2, room 105

what

Convexity is a relatively simple property with enormous implications on fields such as (convex) optimization, (convex) geometry, combinatorics and algebra. On the discrete side, an equally important notion is that of a submodular function (Google this!) which arises in many contexts such as (combinatorial) optimization, (geometric) combinatorics, and (real) algebra. The focus of this seminar is on the interplay between these two notions from various perspectives.
If you are curious
  • how polymatroids constrain convex (algebraic) bodies
  • how polyhedra can represent convexifications of submodular functions, or
  • how combinatorial objects such as spanning trees, characteristic polynomials, graph colorings relate to the geometry of subspaces
you are very welcome to actively participate in this seminar that will feature submodularity and convexity from its beginnings to current research. A list of potential topics is here.

If you are interested and need more information, feel free to contact me!

when

Wednesday, 10:15-12:00, Arnimallee 2 (Villa), Seminar room

who

April 25 Kolja SubModFcts in Combinatorial Optimization
May 2 Lennart Arrangements and operations on SubModFcts I
May 9 Lennart Arrangements and operations on SubModFcts II
May 16 Philip Polyhedra associated to SubModFcts I
May 23 Philip Polyhedra associated to SubModFcts II
May 30 Katharina M. Minimizing SubModFcts I
June 6 Katharina M. Minimizing SubModFcts II
June 13 no seminar
June 20 no seminar
June 27 Karim Hyperbolic polynomials
July 4 Kolja Submodular Functions in Information Theory
July 11 no seminar