Abstract
A tight upper bound is obtained for the minimal completion rank of a partial block matrix P whose block pattern is a single bipartite cycle of order 2k and with specified blocks of order n having non-vanishing determinant. The problem is studied in terms of two auxiliary matrix problems of independent interest, in which a difference between two matrices is divided into ‘small-rank steps’.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
