Multiple Horn problems for planar networks and invertible matrices
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915186024120320 |
|---|---|
| author | Alekseev, Anton Berenstein, Arkady Gurenkova, Anfisa Li, Yanpeng |
| author_facet | Alekseev, Anton Berenstein, Arkady Gurenkova, Anfisa Li, Yanpeng |
| contents | The multiplicative multiple Horn problem is asking to determine possible singular values of the combinations $AB, BC$ and $ABC$ for a triple of invertible matrices $A,B,C$ with given singular values. There are similar problems for eigenvalues of sums of Hermitian matrices (the additive problem), and for maximal weights of multi-paths in concatenations of planar networks (the tropical problem).
For the planar network multiple Horn problem, we establish necessary conditions, and we conjecture that for large enough networks they are also sufficient. These conditions are given by the trace equalities and rhombus inequalities (familiar from the hive description of the classical Horn problem), and by the new set of tetrahedron equalities. Furthermore, if one imposes Gelfand-Zeitlin conditions on weights of planar networks, tetrahedron equalities turn into the octahedron recurrence from the theory of crystals. We give a geometric interpretation of our results in terms of positive varieties with potential. In this approach, rhombus inequalities follow from the inequality $Φ^t \leqslant 0$ for the tropicalized potential, and tetrahedron equalities are obtained as tropicalization of certain Plücker relations.
For the multiplicative problem, we introduce a scaling parameter $s$, and we show that for $s$ large enough (corresponding to exponentially large/small singular values) the Duistermaat-Heckman measure associated to the multiplicative problem concentrates in a small neighborhood of the octahedron recurrence locus. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_05277 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multiple Horn problems for planar networks and invertible matrices Alekseev, Anton Berenstein, Arkady Gurenkova, Anfisa Li, Yanpeng Representation Theory Symplectic Geometry The multiplicative multiple Horn problem is asking to determine possible singular values of the combinations $AB, BC$ and $ABC$ for a triple of invertible matrices $A,B,C$ with given singular values. There are similar problems for eigenvalues of sums of Hermitian matrices (the additive problem), and for maximal weights of multi-paths in concatenations of planar networks (the tropical problem). For the planar network multiple Horn problem, we establish necessary conditions, and we conjecture that for large enough networks they are also sufficient. These conditions are given by the trace equalities and rhombus inequalities (familiar from the hive description of the classical Horn problem), and by the new set of tetrahedron equalities. Furthermore, if one imposes Gelfand-Zeitlin conditions on weights of planar networks, tetrahedron equalities turn into the octahedron recurrence from the theory of crystals. We give a geometric interpretation of our results in terms of positive varieties with potential. In this approach, rhombus inequalities follow from the inequality $Φ^t \leqslant 0$ for the tropicalized potential, and tetrahedron equalities are obtained as tropicalization of certain Plücker relations. For the multiplicative problem, we introduce a scaling parameter $s$, and we show that for $s$ large enough (corresponding to exponentially large/small singular values) the Duistermaat-Heckman measure associated to the multiplicative problem concentrates in a small neighborhood of the octahedron recurrence locus. |
| title | Multiple Horn problems for planar networks and invertible matrices |
| topic | Representation Theory Symplectic Geometry |
| url | https://arxiv.org/abs/2503.05277 |