SEVERAL QUESTIONS OF LONGSTAFF ON GENERATION IN MATRIX ALGEBRAS
- 19 May 2026
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 114 (2) , 1-5
Abstract
We solve three problems raised in recent articles by Longstaff [ Bull. Aust. Math. Soc. 102 (2020), 226–236; 103 (2021), 260–270; 104 (2021), 78–93]. We show that: (1) the length of an irreducible family of $n\times n$ rank-one matrices can take any value $1,2,\ldots ,n$ ; (2) the slot length of an irreducible pair of $n\times n$ matrices can exceed $2n-4$ ; and (3) we give bounds on the $1$ -minimum spanning lengths of irreducible pairs.
Keywords
This publication has 5 references indexed in Scilit:
- -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITYBulletin of the Australian Mathematical Society, 2020
- THE SLOT LENGTH OF A FAMILY OF MATRICESBulletin of the Australian Mathematical Society, 2020
- IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIXBulletin of the Australian Mathematical Society, 2020
- The effect of assuming the identity as a generator on the length of the matrix algebraLinear Algebra and its Applications, 2016
- Theory of Graphs1962