BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Inequalities: from Hermitian matrices to planar networks
DTSTART:20161019T171500
DTEND:20161019T183000
DTSTAMP:20260510T084031Z
UID:0769ed628b7596ab3c2da3a0d4153e277fa119188090779aae560192
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Anton Alekseev\, Université de Genève\nThe same set of
  inequalities comes up in two problems of very different nature. The first
  one is the Horn problem in Linear Algebra asking for possible eigenvalues
  of a sum of two Hermitian matrices with given spectra. This problem has a
  rich history dating back to the work by H. Weyl in 1912. A complete sol
 ution was obtain in 1998 by Klyachko and by Knutson-Tao. The second probl
 em is related to combinatorics of paths in weighted planar networks (a s
 pecial type of planar graphs). In the talk\, we shall introduce the two p
 roblems and explain the relation between them which goes via symplectic 
 geometry\, the theory of total positivity and cluster algebras.
LOCATION:CE 1 2 https://plan.epfl.ch/?room==CE%201%202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR