J. Aust. Math. Soc.
76 (2004), 317328  
On decomposition of sublinearised polynomials
 
 
Abstract  
We give a detailed exposition of the theory of
decompositions of linearised polynomials, using a
wellknown connection with skewpolynomial rings
with zero derivative. It is known that there is a
onetoone correspondence between decompositions
of linearised polynomials and sublinearised
polynomials. This correspondence leads to a
formula for the number of indecomposable
sublinearised polynomials of given degree over a
finite field. We also show how to extend existing
factorisation algorithms over skewpolynomial
rings to decompose sublinearised polynomials
without asymptotic cost.
 
Download the article in PDF format (size 102 Kb)  
 
