On the number of invariant factors of matrix products

Detalhes bibliográficos
Autor(a) principal: Sá, E. Marques de
Data de Publicação: 2005
Outros Autores: Zhang Yu Lin
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/1822/11165
Resumo: In the first part of the paper we determine bounds for the ranks of certain submatrices of square matrices taken from a prescribed similarity class. Then we discuss the concept of offdiagonal indices (defined in Section 1) which, very roughly speaking, measure, for each given integer s, how far we have to go off the main diagonal of a square matrix, to find an s s nonzero minor. Some open problems are stated.
id RCAP_b68f7c42ae87f9ab9b70368ae991546e
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/11165
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling On the number of invariant factors of matrix productsMatricesSimilarityRankInvariant polynomialsnilpotent matricesinvariant factorsScience & TechnologyIn the first part of the paper we determine bounds for the ranks of certain submatrices of square matrices taken from a prescribed similarity class. Then we discuss the concept of offdiagonal indices (defined in Section 1) which, very roughly speaking, measure, for each given integer s, how far we have to go off the main diagonal of a square matrix, to find an s s nonzero minor. Some open problems are stated.Fundação para a Ciência e a Tecnologia (FCT)ElsevierUniversidade do MinhoSá, E. Marques deZhang Yu Lin20052005-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/11165eng“Linear Algebra and Its Applications”. ISSN 0024-3795. 401 (May 2005) 393-399.0024-379510.1016/j.laa.2004.10.029www.elsevier.cominfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:33:40Zoai:repositorium.sdum.uminho.pt:1822/11165Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:29:13.831189Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv On the number of invariant factors of matrix products
title On the number of invariant factors of matrix products
spellingShingle On the number of invariant factors of matrix products
Sá, E. Marques de
Matrices
Similarity
Rank
Invariant polynomials
nilpotent matrices
invariant factors
Science & Technology
title_short On the number of invariant factors of matrix products
title_full On the number of invariant factors of matrix products
title_fullStr On the number of invariant factors of matrix products
title_full_unstemmed On the number of invariant factors of matrix products
title_sort On the number of invariant factors of matrix products
author Sá, E. Marques de
author_facet Sá, E. Marques de
Zhang Yu Lin
author_role author
author2 Zhang Yu Lin
author2_role author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Sá, E. Marques de
Zhang Yu Lin
dc.subject.por.fl_str_mv Matrices
Similarity
Rank
Invariant polynomials
nilpotent matrices
invariant factors
Science & Technology
topic Matrices
Similarity
Rank
Invariant polynomials
nilpotent matrices
invariant factors
Science & Technology
description In the first part of the paper we determine bounds for the ranks of certain submatrices of square matrices taken from a prescribed similarity class. Then we discuss the concept of offdiagonal indices (defined in Section 1) which, very roughly speaking, measure, for each given integer s, how far we have to go off the main diagonal of a square matrix, to find an s s nonzero minor. Some open problems are stated.
publishDate 2005
dc.date.none.fl_str_mv 2005
2005-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/11165
url http://hdl.handle.net/1822/11165
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv “Linear Algebra and Its Applications”. ISSN 0024-3795. 401 (May 2005) 393-399.
0024-3795
10.1016/j.laa.2004.10.029
www.elsevier.com
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799132790584770560

Registros relacionados