{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:20:22Z","timestamp":1776842422836,"version":"3.51.2"},"reference-count":20,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":2223,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2004]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper deals with the problem of finding the least length of a product of <jats:italic>n<\/jats:italic> binomials. A theorem of R. Maltby has shown that the problem is algorithmically solvable for any fixed <jats:italic>n<\/jats:italic>. 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.<\/jats:p>","DOI":"10.1112\/s1461157000001030","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T07:42:22Z","timestamp":1375774942000},"page":"37-49","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bounds for Norms of Products of Binomials"],"prefix":"10.1112","volume":"7","author":[{"given":"Mihai","family":"Cipu","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000001030_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01393823"},{"key":"S1461157000001030_ref003","first-page":"31","article-title":"On an estimate for the free term of a nonnegative trigonometric polynomial with integer coefficient\u2019(in russian)","volume":"60","author":"Belov","year":"1996","journal-title":"lzv. Ross. Akad. Nauk Ser. Mat."},{"key":"S1461157000001030_ref015","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1994-1169037-9"},{"key":"S1461157000001030_ref013","first-page":"29","article-title":"On the product","volume":"13","author":"Erd\u0151s","year":"1959","journal-title":"Acad. Serbe Sci. Publ. Inst. Math."},{"key":"S1461157000001030_ref008","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2000.10504419"},{"key":"S1461157000001030_ref016","unstructured":"16. Maltby R. , \u2018Pure product polynomials of small norm\u2019, Ph.D. thesis, Simon Fraser University, (1996)."},{"key":"S1461157000001030_ref019","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90218-9"},{"key":"S1461157000001030_ref012","doi-asserted-by":"crossref","first-page":"391","DOI":"10.4064\/aa-34-4-391-401","article-title":"On a question of Lehmer and the number of irreducible factors of a polynomial","volume":"34","author":"Dobrowolski","year":"1976","journal-title":"Acta Arithum."},{"key":"S1461157000001030_ref001","first-page":"1021","article-title":"Polynomials with prescribed vanishing at roots of unity","volume":"9","author":"Amoroso","year":"1995","journal-title":"Boll. Un. Mat. Ital."},{"key":"S1461157000001030_ref002","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1961-002-5"},{"key":"S1461157000001030_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4816-3_3"},{"key":"S1461157000001030_ref009","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00892-2"},{"key":"S1461157000001030_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-01-01360-6"},{"key":"S1461157000001030_ref011","first-page":"41","article-title":"The norm of a product of cyclotomic polynomials and the Prouhet-Tarry-Escott problem\u2019(in Romanian)","author":"Cipu","year":"1998","journal-title":"Proc. Second Yearly Nat. Conf Romanian Soc. Math. Sci."},{"key":"S1461157000001030_ref007","first-page":"3","article-title":"The Prouhet-Tarry-Escott problem revisited","volume":"40","author":"Borwein","year":"1994","journal-title":"L'Enseign. Math."},{"key":"S1461157000001030_ref006","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1976-0422300-8"},{"key":"S1461157000001030_ref020","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-26.3.412"},{"key":"S1461157000001030_ref017","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00865-X"},{"key":"S1461157000001030_ref014","first-page":"1","volume-title":"Number theory for the millenium","author":"Filaseta","year":"2002"},{"key":"S1461157000001030_ref018","doi-asserted-by":"crossref","first-page":"229","DOI":"10.4064\/aa-81-3-229-245","article-title":"Root systems and the Erd\u0151s-Szekeres problem","volume":"81","author":"Maltby","year":"1997","journal-title":"Acta Arithm."}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000001030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T20:46:52Z","timestamp":1559854012000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000001030\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":20,"alternative-id":["S1461157000001030"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000001030","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}