IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIX
From MaRDI portal
Publication:5118583
DOI10.1017/S0004972719001448zbMath1447.15012OpenAlexW3000560031WikidataQ126347950 ScholiaQ126347950MaRDI QIDQ5118583
Publication date: 26 August 2020
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972719001448
Related Items (7)
The lengths of matrix incidence algebras over small finite fields ⋮ Generating systems of the full matrix algebra that contain nonderogatory matrices ⋮ On the lengths of matrix incidence algebras with radicals of square zero ⋮ On generators of incidence rings over finite posets ⋮ Length function and simultaneous triangularization of matrix pairs ⋮ -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY ⋮ THE SLOT LENGTH OF A FAMILY OF MATRICES
Cites Work
- An upper bound for the length of a finite-dimensional algebra
- 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
- Simultaneous triangularization
- An improved bound for the lengths of matrix algebras
- Length realizability for pairs of quasi-commuting matrices
- Length computation of matrix subalgebras of special type.
- The length function and matrix algebras
- On the lengths of irreducible pairs of complex matrices
- ON THE LENGTHS OF PAIRS OF COMPLEX MATRICES OF SIZE SIX
- An application of the Cayley-Hamilton theorem to matrix polynomials in several variables
- ON MINIMAL SETS OF -MATRICES WHOSE PAIRWISE PRODUCTS FORM A BASIS FOR
- On the lengths of pairs of complex matrices of size at most five
This page was built for publication: IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIX
