Polynomials for the Jordan decomposition in characteristic p

Given a polynomial in characteristic p, the algorithm here will (without factorization) find a separable polynomial with the same irreducible factors or prove that none exists. This is what is needed to compute the Jordan decomposition of a matrix in characteristic p. Supplementary propositions and...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 2004-11, Vol.392, p.39-44
Main Author: Waterhouse, William C.
Format: Article
Language:English
Subjects:
Algebra
Exact sciences and technology
Field theory and polynomials
Jordan decomposition
Mathematics
Sciences and techniques of general use
Separable polynomial
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a polynomial in characteristic p, the algorithm here will (without factorization) find a separable polynomial with the same irreducible factors or prove that none exists. This is what is needed to compute the Jordan decomposition of a matrix in characteristic p. Supplementary propositions and examples indicate how to carry out the computations over finitely generated fields.
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2004.05.012