Article contents
A lower bound for the degree of polynomials satisfied by matrices
Published online by Cambridge University Press: 09 April 2009
Abstract
R. Paré and W. Schelter (1978) have extended the Cayley-Hamilton theorem by showing that for each n<1 there is an integer k such that all n x n matrices over any (possibly noncommutative) ring satisfy a monic polynomial of degree k. We give a lower bound for this degree, namely π(n), which is defined as the shortest possible length of a sequence with entries from {1, 2, …, n}.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1979
References
- 4
- Cited by