to helmut wielandt for his 90th birthday with much respect and many congratulations , where m X t is its minimal polynomial and c X t is its characteristic polynomial det tI -X . This condition is equivalent to requiring the vector space F d of 1 × d row vectors over F to be cyclic as an F X -modul
Computing in unitriangular matrices over finite fields
✍ Scribed by Antonio Vera-López; J.M Arregi
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 285 KB
- Volume
- 387
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It has been known for some time that every polynomial with coefficients from a finite field is the minimum polynomial of a symmetric matrix with entries from the same field. What have remained unknown, however, are the possible sizes for the symmetric matrices with a specified minimum polynomial and
In this paper, we provide an account of several new techniques for computing the primitive idempotents of a commutative artinian algebra over a finite field. Examples of such algebras include the center of a finite group algebra or any finite dimensional quotient of a polynomial ring. The computatio
Connections between q-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel's q-hit polynomial. Both this new statistic mat and another statistic for the q-hit polynomial recently introduced by Dworkin are shown to induce different multiset Ma