Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, BC, Canada V5A 1S6
Abstract:
An -factor pure product is a polynomial which can be expressed in the form for some natural numbers . We define the norm of a polynomial to be the sum of the absolute values of the coefficients. It is known that every -factor pure product has norm at least . We describe three algorithms for determining the least norm an -factor pure product can have. We report results of our computations using one of these algorithms which include the result that every -factor pure product has norm strictly greater than if is , , , or .