The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
A technique to expedite iterative computations which is based on multidimensional chains of recurrences MCR is presented. Algorithms for MCR construction, interpretation and MCR-b...
This note presents a new algorithm for the computation of the set of normal subgroups of a finite group. It is based on lifting via homomorphic images.
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula M...