THE SLOT LENGTH OF A FAMILY OF MATRICES

DOI10.1017/S0004972720000726zbMath1464.15046OpenAlexW3092421134MaRDI QIDQ5857593

William Ellison Longstaff

Publication date: 1 April 2021

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972720000726

zbMATH Keywords

irreduciblelinear span

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Miscellaneous inequalities involving matrices (15A45)

Related Items (1)

-MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY

Cites Work

• A resolution of Paz's conjecture in the presence of a nonderogatory matrix
• Burnside's theorem: Irreducible pairs of transformations
• The simplest proof of Burnside's theorem on matrix algebras
• An improved bound for the lengths of matrix algebras
• The length function and matrix algebras
• On the lengths of irreducible pairs of complex matrices
• An application of the Cayley-Hamilton theorem to matrix polynomials in several variables
• IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIX
• On the lengths of pairs of complex matrices of size at most five

This page was built for publication: THE SLOT LENGTH OF A FAMILY OF MATRICES