The Horn problem and planar networks

From MaRDI portal
Publication:2401701

DOI10.1016/J.AIM.2017.01.019zbMATH Open1369.05207arXiv1207.0640OpenAlexW2962944899MaRDI QIDQ2401701FDOQ2401701


Authors: Anton Alekseev, Masha Podkopaeva, András Szenes Edit this on Wikidata


Publication date: 4 September 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: The problem of determining the set of possible eigenvalues of 3 Hermitian matrices that sum up to zero is known as the Horn problem. The answer is a polyhedral cone, which, following Knutson and Tao, can be described as the projection of a simpler cone in the space of triangular tableaux (or hives) to the boundary nodes of the tableau. In this paper, we introduce a combinatorial problem defined in terms of certain weighted planar graphs giving rise to exactly the same polyhedral cone. In our framework, the values at the inner nodes of the triangular tableaux receive a natural interpretation. Other problems of linear algebra fit into the same scheme, among them the Gelfand--Zeitlin problem. Our approach is motivated by the works of Fomin and Zelevinsky on total positivity and by the ideas of tropicalization.


Full work available at URL: https://arxiv.org/abs/1207.0640




Recommendations




Cites Work


Cited In (8)





This page was built for publication: The Horn problem and planar networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401701)