On the lengths of pairs of complex matrices of size at most five

Publisher： Cambridge University Press

E-ISSN： 1755-1633|73|3|461-472

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.73, Iss.3, 2006-06, pp. : 461-472

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

ON THE LENGTHS OF PAIRS OF COMPLEX MATRICES OF SIZE SIX

By  

Bulletin of the Australian Mathematical Society, Vol. 80, Iss. 2, 2009-10 ,pp. : 177-201

Cambridge University Press

Access to resources Recommend Favorite

Rank distance problem for pairs of matrices

By Dodig Marija  

Linear and Multilinear Algebra, Vol. 61, Iss. 2, 2013-02 ,pp. : 205-215

Taylor & Francis Ltd

Access to resources Recommend Favorite

Linear Operators that Preserve Commuting Pairs of Nonnegative Real Matrices

By LeRoy B. Beasley  

Linear and Multilinear Algebra, Vol. 51, Iss. 3, 2003-09 ,pp. : 279-283

Taylor & Francis Ltd

Access to resources Recommend Favorite

Most finitely generated subgroups of infinite unitriangular matrices are free

By  

Bulletin of the Australian Mathematical Society, Vol. 66, Iss. 3, 2002-12 ,pp. : 419-423

Cambridge University Press

Access to resources Recommend Favorite

Discrete spectrum for complex perturbations of periodic Jacobi matrices

By Egorova Iryna   Golinskii Leonid  

Journal of Difference Equations and Applications, Vol. 11, Iss. 14, 2005-12 ,pp. : 1185-1203

Taylor & Francis Ltd

Access to resources Recommend Favorite