pith. sign in

arxiv: 1002.3180 · v1 · submitted 2010-02-16 · 💻 cs.MS · cs.SC

Factorization of Non-Commutative Polynomials

classification 💻 cs.MS cs.SC
keywords algorithmfactorizationnon-commutativepolynomialssketchversionalgebraappeared
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.