paper

On integral polytopes related to Edmonds' problem

arXiv:2609.19703

Abstract

In this paper, we study polyhedral aspects on commutative and noncommutative Edmonds' problems for computing the rank of linear symbolic matrix . We regard them as linear optimization over integral polytopes and , respectively, which are obtained by the convex hulls of exponent vectors of subdeterminants of~ and its blow-ups . By extending previously known results on nc-rank, we establish a hierarchy of integral polytopes and show that the integrality gap of relative to is at least . Further, we show that if each is rank-2 skew-symmetric, then the above hierarchy terminates at the second level and the integrality gap is improved to .