THE SLOT LENGTH OF A FAMILY OF MATRICES
- 5 October 2020
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 103 (2) , 260-270
Abstract
We introduce the notion of the slot length of a family of matrices over an arbitrary field . Using this definition it is shown that, if and A and B are complex matrices with A unicellular and the pair irreducible, the slot length s of satisfies , where both inequalities are sharp, for every n. It is conjectured that the slot length of any irreducible pair of matrices, where , is at most . The slot length of a family of rank-one complex matrices can be equal to n.Keywords
This publication has 9 references indexed in Scilit:
- IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIXBulletin of the Australian Mathematical Society, 2020
- An improved bound for the lengths of matrix algebrasAlgebra & Number Theory, 2019
- A resolution of Paz's conjecture in the presence of a nonderogatory matrixLinear Algebra and its Applications, 2018
- The length function and matrix algebrasJournal of Mathematical Sciences, 2013
- On the lengths of irreducible pairs of complex matricesProceedings of the American Mathematical Society, 2011
- On the lengths of pairs of complex matrices of size at most fiveBulletin of the Australian Mathematical Society, 2006
- The simplest proof of Burnside's theorem on matrix algebrasLinear Algebra and its Applications, 2004
- Burnside's theorem: irreducible pairs of transformationsLinear Algebra and its Applications, 2004
- An application of the Cayley-Hamilton theorem to matrix polynomials in several variablesLinear and Multilinear Algebra, 1984