Given a monic polynomial f over finite fields F, (i.e. the coefficents of f are in the field F), we will factor f into product of irreducible monic polynomials. (a polynomial is irreducible if it is ...

I have been talking to Thomas Sturm at ACA today and together we had the following idea, which we should discuss, since it opens up a fully new field of applications for the MWS stystem. The ...

We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, ...

Abstract: A method is presented for polynomial factorization using a search method. The method used is to search for real parts of roots by iteratively applying the Routh test to a shifted polynomial.

We consider polynomials of bi-degree (n, 1) over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally ...

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), ...

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known ...

Recently, I applied to a fellowship with Math for America, a program dedicated to improving mathematics education in U.S. public schools by recruiting, training, and retaining highly qualified ...