BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:"The Horn problem and planar networks"
DTSTART:20120507T171500
DTEND:20120507T180000
DTSTAMP:20260412T173808Z
UID:c4be9e6df0104bedf9654f7a70ea67679f66617977e7aac5b42900e0
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Anton ALEKSEEV (Université de Genève)\nAbstract:\n\nTh
 e same set of inequalities comes up in two seemingly very different\nconte
 xts. The first one is the Horn problem in Linear Algebra. It addresses\nth
 e relation between the eigenvalues of a pair of two Hermitian matrices\nan
 d of their sum. This is a hard problem which was settled by Klyachko\nand 
 by Knutson-Tao in the end of 1990's. The second context is combinatorics\n
 of planar networks equipped with Boltzmann weights on the edges.\n\nIn the
  talk\, we explain a link between the two theories. It passes by the theor
 y\nof Poisson-Lie groups.
LOCATION: MA A3 30
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR