Abstract
AbstractThis paper deals with the problem of finding the least length of a product of n binomials. A theorem of R. Maltby has shown that the problem is algorithmically solvable for any fixed n. Here, a different proof is presented for this result, and yields improved complexity. The author reports the results of computations of the upper bounds on the least length or Euclidean norm of a product of binomials.
Subject
Computational Theory and Mathematics,General Mathematics
Reference20 articles.
1. On Siegel's lemma
2. On an estimate for the free term of a nonnegative trigonometric polynomial with integer coefficient’(in russian);Belov;lzv. Ross. Akad. Nauk Ser. Mat.,1996
3. On nonnegative cosine polynomials with nonnegative integral coefficients
4. On the product;Erdős;Acad. Serbe Sci. Publ. Inst. Math.,1959
5. Polynomials with Height 1 and Prescribed Vanishing at 1