2026-08-10T17:55:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4474 2024-03-06T10:35:06Z ddc:004 open_access

Generalized Wong sequences and their applications to Edmonds' problems Ivanyos, Gábor Karpinski, Marek Qiao, Youming Santha, Miklos symbolic determinantal identity testing Edmonds' problem maximum rank matrix completion derandomization Wong sequences We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B of the nxn matrices over some field F, we consider the following problems: symbolic matrix rank (SMR) is the problem to determine the maximum rank among matrices in B, while symbolic determinant identity testing (SDIT) is the question to decide whether there exists a nonsingular matrix in B. The constructive versions of these problems are asking to find a matrix of maximum rank, respectively a nonsingular matrix, if there exists one. Our first algorithm solves the constructive SMR when B is spanned by unknown rank one matrices, answering an open question of Gurvits. Our second algorithm solves the constructive SDIT when B is spanned by triangularizable matrices, but the triangularization is not given explicitly. Both algorithms work over finite fields of size at least n+1 and over the rational numbers, and the first algorithm actually solves (the non-constructive) SMR independent of the field size. Our main tool to obtain these results is to generalize Wong sequences, a classical method to deal with pairs of matrices, to the case of pairs of matrix spaces. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gábor Ivanyos and Marek Karpinski and Youming Qiao and Miklos Santha 2014 Is Part Of LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2014.397 urn:nbn:de:0030-drops-44741 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.397 eng https://creativecommons.org/licenses/by/3.0/legalcode