Matrix completion problems over integral domains: The case with a diagonal of prescribed blocks

Let R be an arbitrary integral domain, let ∧={λ1,…,λn} be a multiset of elements of R, let σ be a permutation of {1,…,k} let n1,…,nk be positive integers such that n1+⋯+nk=n, and for r=1,…,k let Ar∈Rnr×nσ(r). We are interested in the problem of finding a block matrix with spectrum Λ and such that Qrσ(r)=Ar for r=1,…,k. Cravo and Silva completely characterized the existence of such a matrix when R is a field. In this work we construct a solution matrix Q that solves the problem when R is an integral domain with two exceptions: (i) k=2; (ii) k≥3, σ(r)=r and nr>n/2 for some r.What makes this work quite unique in this area is that we consider the problem over the more general algebraic structure of integral domains, which includes the important case of integers. Furthermore, we provide an explicit and easy to implement finite step algorithm that constructs an specific solution matrix (we point out that Cravo and Silva’s proof is not constructive).