A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
From MaRDI portal
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}.
Recommendations
- 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
Cites work
Cited in
(30)- Factorization theory in commutative monoids
- Irreducible polynomials and full elasticity in rings of integer-valued polynomials
- A realization result for systems of sets of lengths
- Semigroup rings as weakly Krull domains
- Non-unique factorization of polynomials over residue class rings of the integers
- Non-absolutely irreducible elements in the ring of integer-valued polynomials
- Puiseux monoids and transfer homomorphisms
- Power monoids: a bridge between factorization theory and arithmetic combinatorics
- On the enumeration of polynomials with prescribed factorization pattern
- A realization theorem for sets of lengths in numerical monoids
- Systems of sets of lengths: transfer Krull monoids versus weakly Krull monoids
- Divisibility in rings of integer-valued polynomials
- Absolute irreducibility of the binomial polynomials
- Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
- The system of sets of lengths in Krull monoids under set addition
- A survey on fixed divisors
- Systems of sets of lengths of Puiseux monoids
- Factorization with respect to a divisor-closed multiplicative submonoid of a ring
- Restricted elasticity and rings of integer-valued polynomials determined by finite subsets
- Lengths of factorizations of integer-valued polynomials on Krull domains with prime elements
- Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations
- Sets of lengths
- Sets of lengths in maximal orders in central simple algebras.
- On length densities
- Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
- Finding Elements With Given Factorization Lengths and Multiplicities
- Factorization of integer-valued polynomials with square-free denominator
- The system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid
- On monoids and domains whose monadic submonoids are Krull
- Open problems in commutative ring theory
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)
