On image sets of integer-valued polynomials
From MaRDI portal
Let \(\mathrm{Int}(Z)\) be the set of all polynomials \(f\in Q[X]\) with \(f(Z)\subset Z\). Two polynomials \(f,g\in \mathrm{Int}(Z)\) are called equivalent if for some \(n\in Z\) one has either \(f(X)=g(X-n)\) or \(f(X)=g(-X-n)\). The authors show that \(f,g\in \mathrm{Int}(Z)\) satisfy \(f(Z)=g(Z)\) if and only if they are either equivalent, or for some odd \(k\) one has \(f(-X)=f(X-k)\) and \(g\) is equivalent to \(f(2X)\).
Recommendations
Cites work
- scientific article; zbMATH DE number 3959605 (Why is no real title available?)
- scientific article; zbMATH DE number 1031245 (Why is no real title available?)
- Integer-valued polynomials
- Interpolation by integer-valued polynomials
- Interpolation domains
- On a theorem of R. Gilmer
- Parametrizing over Z integral values of polynomials over Q
- Sets that determine integer-valued polynomials
- What's new about integer-valued polynomials on a subset?
Cited in
(9)- On the polynomial equivalence of subsets \(E\) and \(f(E)\) of \(\mathbb{Z}\)
- A survey on fixed divisors
- Connectedness of digraphs from quadratic polynomials
- Arithmetical properties of the image of a polynomial with integer coefficients
- Parametrizing over Z integral values of polynomials over Q
- Value-sets of polynomials at p-adic integers
- Parametrization of integral values of polynomials
- Determining Integer-Valued Polynomials From Their Image
- The Image Containment Problem and Some Classes of Polynomial Instances
This page was built for publication: On image sets of integer-valued polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411777)