2025/06/04 by V. I. Danilov, Danilov, Vladimir I., Alexander V. Karzanov +3
Mathematics · Computer Science · #Graph theory and applications #Matrix Theory and Algorithms #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2506.03754
For positive integers n,n', we give a combinatorial characterization for the set of quadratic inequalities on minors that are valid for all n× n' totally nonnegative matrices. This is obtained as a consequence from our earlier results on stable quadratic identities on minors of matrices generated by flows in planar graphs via Lindström's construction.