Show simple item record

dc.creatorBorobia, Albertoes
dc.creatorCanogar, Robertoes
dc.creatorSmigoc, Helenaes
dc.date2017-03-23
dc.date.accessioned2025-10-06T15:04:56Z
dc.date.available2025-10-06T15:04:56Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1289
dc.identifier10.4067/S0716-09172014000200007
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/255459
dc.descriptionLet ∧ = {λ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
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1289/1001
dc.rightsCopyright (c) 2014 Proyecciones. Journal of Mathematicsen
dc.rightshttps://creativecommons.org/licenses/by/4.0en
dc.sourceProyecciones (Antofagasta); Vol. 33 No. 2 (2014); 215-233en
dc.sourceProyecciones. Revista de Matemática; Vol. 33 Núm. 2 (2014); 215-233es
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2014
dc.titleA matrix completion problem over integral domains: the case with 2n — 3 prescribed blockses
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record