Inequalities: from Hermitian matrices to planar networks
Event details
| Date | 19.10.2016 |
| Hour | 17:15 › 18:30 |
| Speaker | Prof. Anton Alekseev, Université de Genève |
| Location | |
| Category | Conferences - Seminars |
The 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 solution was obtain in 1998 by Klyachko and by Knutson-Tao. The second problem is related to combinatorics of paths in weighted planar networks (a special type of planar graphs). In the talk, we shall introduce the two problems and explain the relation between them which goes via symplectic geometry, the theory of total positivity and cluster algebras.
Practical information
- General public
- Free
Organizer
- Clement Hongler
Contact
- Marie Munoz