The LMS JCM, (7) 37-49. Published 08 Mar 2004. First received 19 Jun 2003.


Upper bounds for norms of products of binomials

Mihai Cipu



Abstract: This 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.

This paper is available as PDF (135 KB).

All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.

Go to the Volume 7 index
Return to the LMS JCM Homepage