A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
Let Int(\(\mathbb{Z}\))\(=\{f\in\mathbb{Q}[X] \mid f(\mathbb{Z})\subset\mathbb{Z}\}\) be the ring of integer-valued polynomials. It is well-known that this ring is not a unique factorization domain and its elasticity, defined as the supremum of the set of ratios of lengths of two decompositions of irreducible factors of nonzero nonunit elements, is infinite [\textit{P.-J. Cahen} and \textit{J.-L. Chabert}, J. Pure Appl. Algebra 103, No. 3, 303--311 (1995; Zbl 0843.12001)]. Moreover, Int(\(\mathbb{Z}\)) is fully elastic, which means that every rational number greater than \(1\) occurs as the elasticity of some nonzero nonunit element ([\textit{S. T. Chapman} and \textit{B. A. McClain}, J. Algebra 293, No. 2, 595--610 (2005; Zbl 1082.13001)]). This paper proves again these last two results in a constructive way and goes beyond that. The main result is the following: given a finite set \(S=\{n_1,\dots,n_r\}\) of positive integers greater than \(1\), there exists a polynomial \(f\in\)Int(\(\mathbb{Z}\)) such that \(f(X)\) admits \(r\) distinct factorizations into irreducibles of length \(n_1,\dots,n_r\), respectively. The proof is constructive and allows multiplicities of lengths of factorizations to be specified. Moreover, the common denominator of the coefficients of the polynomial \(f(X)\) is a prime \(p\), that is, \(f(X)\) is of the form \(\frac{g(X)}{p}\), for some polynomial \(g(X)\) with integer coefficients. The proof is obtained by recalling first the possible factorizations that an integer-valued polynomial of the form \(\frac{g(X)}{p}\) can have inside Int(\(\mathbb{Z}\)), which depends on the irreducible factors of \(g(X)\) in \(\mathbb{Z}[X]\). Then, the core of the above main result is Lemma 6 which shows the following: given a finite number of polynomials \(f_1(X),\dots,f_n(X)\) in \(\mathbb{Z}[X]\), there exist irreducible polynomials \(F_1(X),\dots,F_n(X)\) in \(\mathbb{Z}[X]\), pairwise non-associated, with \(\deg(f_i)=\deg(F_i)\) for all \(i=1,\dots,n\), such that the fixed divisor of the product of a subset of the \(f_i(X)\)'s is the same as the fixed divisor of the product of the \(F_i(X)\)'s.
- Irreducible polynomials and full elasticity in rings of integer-valued polynomials
- Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
- scientific article; zbMATH DE number 1104249
- Factorization of integer-valued polynomials with square-free denominator
- Restricted elasticity and rings of integer-valued polynomials determined by finite subsets
- Power monoids: a bridge between factorization theory and arithmetic combinatorics
- Systems of sets of lengths of Puiseux monoids
- A realization theorem for sets of lengths in numerical monoids
- Puiseux monoids and transfer homomorphisms
- A survey on fixed divisors
- Divisibility in rings of integer-valued polynomials
- On length densities
- On the enumeration of polynomials with prescribed factorization pattern
- A realization result for systems of sets of lengths
- Semigroup rings as weakly Krull domains
- Factorization theory in commutative monoids
- Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
- Sets of lengths in maximal orders in central simple algebras.
- Restricted elasticity and rings of integer-valued polynomials determined by finite subsets
- Irreducible polynomials and full elasticity in rings of integer-valued polynomials
- Absolute irreducibility of the binomial polynomials
- On monoids and domains whose monadic submonoids are Krull
- Open problems in commutative ring theory
- Non-unique factorization of polynomials over residue class rings of the integers
- The system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid
- Finding Elements With Given Factorization Lengths and Multiplicities
- Sets of lengths
- Factorization with respect to a divisor-closed multiplicative submonoid of a ring
- Systems of sets of lengths: transfer Krull monoids versus weakly Krull monoids
- Non-absolutely irreducible elements in the ring of integer-valued polynomials
- Factorization of integer-valued polynomials with square-free denominator
- Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations
- Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
- Lengths of factorizations of integer-valued polynomials on Krull domains with prime elements
- Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely
- On algebraic properties of power monoids of numerical monoids
- Factorization in rings of integer-valued rational functions
- Sets of lengths of integer-valued polynomials on prime ideals of principal ideal domains
- The system of sets of lengths in Krull monoids under set addition
- On sets of lengths in monoids of plus-minus weighted zero-sum sequences over abelian groups
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)
