A construction of integer-valued polynomials with prescribed sets of lengths of factorizations

From MaRDI portal
Publication:368525

DOI10.1007/S00605-013-0508-ZzbMATH Open1282.13004arXiv1112.5753OpenAlexW3105866816WikidataQ59299058 ScholiaQ59299058MaRDI QIDQ368525FDOQ368525


Authors: Sophie Frisch Edit this on Wikidata


Publication date: 23 September 2013

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Abstract: For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a product of n irreducibles in Int(Z)={g in Q[x] | g(Z) contained in Z}.


Full work available at URL: https://arxiv.org/abs/1112.5753




Recommendations




Cites Work


Cited In (30)





This page was built for publication: A construction of integer-valued polynomials with prescribed sets of lengths of factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368525)