A matrix completion problem over integral domains: the case with 2n — 3 prescribed blocks

dc.creator	Borobia, Alberto
dc.creator	Canogar, Roberto
dc.creator	Smigoc, Helena
dc.date	2017-03-23
dc.identifier	http://www.revistaproyecciones.cl/article/view/1289
dc.identifier	10.4067/S0716-09172014000200007
dc.description	Let ∧ = {λ1,...,λnk} be amultisetofelements ofanintegral domain R.Let P be a partially prescribed n X n block matrix such that each prescribed entry is a k—block (a k X k matrix over R). If P has at most 2n — 3 prescribed entries then the unprescribed entries of P can be filled with k—blocks to obtain a matrix over R with spectrum ∧ (some natural conditions on the prescribed entries are required). We describe an algorithm to construct such completion.	es-ES
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Católica del Norte.	es-ES
dc.relation	http://www.revistaproyecciones.cl/article/view/1289/1001
dc.rights	Derechos de autor 2014 Proyecciones. Journal of Mathematics	es-ES
dc.source	Proyecciones. Journal of Mathematics; Vol 33 No 2 (2014); 215-233	en-US
dc.source	Proyecciones. Revista de Matemática; Vol. 33 Núm. 2 (2014); 215-233	es-ES
dc.source	0717-6279
dc.source	0716-0917
dc.title	A matrix completion problem over integral domains: the case with 2n — 3 prescribed blocks	es-ES
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES