Complete characterization of the tropical multiple Horn solution set for large networks

Let mHornΠ1,Π2,Π3{\rm mHorn}^{\Pi_1,\Pi_2,\Pi_3} be the set of 6-tuples realized by maximal multi-paths in the concatenation of planar networks Π1\Pi_1, Π2\Pi_2, and Π3\Pi_3. The trace equalities, rhombus inequalities, and tetrahedron equalities are the conditions described for this set; in particular, if mλ,,mτm_\lambda,\dots,m_\tau are the numbers assigned to the relevant tetrahedron vertices, then

α=mλ+mν,β=mμ+mτ,γ=mρ+mσ\alpha=m_\lambda+m_\nu,\qquad \beta=m_\mu+m_\tau,\qquad \gamma=m_\rho+m_\sigma

and the tetrahedron equalities are

αmax{β,γ},βmax{γ,α},γmax{α,β}.\alpha\leqslant\operatorname{max}\{\beta,\gamma\},\qquad \beta\leqslant\operatorname{max}\{\gamma,\alpha\},\qquad \gamma\leqslant\operatorname{max}\{\alpha,\beta\}.

Tropical multiple Horn conjecture. For sufficiently large networks Π1,Π2,Π3\Pi_1,\Pi_2,\Pi_3, for example standard networks, these conditions are necessary and sufficient. Equivalently, mHornΠ1,Π2,Π3{\rm mHorn}^{\Pi_1,\Pi_2,\Pi_3} is completely described by the trace equalities, tetrahedron equalities, and rhombus inequalities.

The paper proves necessity of these conditions. Sufficiency is conjectured for large networks; the standard-network setting is highlighted as an example but is not proved in the stated passage.

Sources & referencesView supporting material

Primary source

Anton Alekseev, Arkady Berenstein, Anfisa Gurenkova and Yanpeng Li, “Multiple Horn problems for planar networks and invertible matrices”, arXiv:2503.05277 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.