Factorization of Non-Commutative Polynomials

2010/02/16 by Caruso, Fabrizio
#F.2.1 #FOS: Computer and information sciences #Mathematical Software (cs.MS) #Symbolic Computation (cs.SC)

paper · doi:10.48550/arxiv.1002.3180

Abstract

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years ago. This version of the algorithm contains some improvements with respect to the original sketch. An improved version of the algorithm has been fully implemented in the Axiom computer algebra system.

Related

• On Efficient Noncommutative Polynomial Factorization via Higman Linearization
• From factorizations of noncommutative polynomials to combinatorial topology
• Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• Matrix Polynomial Factorization via Higman Linearization