Integer-valued polynomial

In mathematics, an integer-valued polynomial (also known as a numerical polynomial) is a polynomial whose value is an integer for every integer input. Every polynomial with integer coefficients is integer-valued, but the converse is not true. For example, the polynomial

P(t)=t2+t2=t(t+1)2

takes on integer values whenever t is an integer. That is because one of t and t+1 must be an even number.

Integer-valued polynomials are objects of study in their own right in algebra, and frequently appear in algebraic topology.

Classification

The class of integer-valued polynomials was described fully by George Pólya. Inside the polynomial ring ℚ[t] of polynomials with rational number coefficients, the subring of integer-valued polynomials is a free abelian group with basis the polynomials

Pk(t)=t(t−1)⋯(t−k+1)/k!

for k=0,1,2,…, i.e., the binomial coefficients. In other words, every integer-valued polynomial can be written as an integer linear combination of binomial coefficients in exactly one way. The proof is by the method of discrete Taylor series: binomial coefficients are integer-valued polynomials, and conversely, the discrete difference of an integer series is an integer series, so the discrete Taylor series of an integer series generated by a polynomial has integer coefficients (and is a finite series).

Fixed prime divisors

Integer-valued polynomials may be used effectively to solve questions about fixed divisors of polynomials. For example, the polynomials P with integer coefficients that always take on even number values are just those for which P/2 is integer-valued. Those in turn are the polynomials that may be expressed as a linear combination with even integer coefficients of the binomial coefficients.

In questions of prime number theory, such as Schinzel's hypothesis H and the Bateman–Horn conjecture, it is important to understand the case when P has no fixed prime divisor (this has been called Bunyakovsky's property,[citation needed] after Viktor Bunyakovsky). By writing P in terms of the binomial coefficients, we see the highest fixed prime divisor is also the highest prime common factor of the coefficients in such a representation. So Bunyakovsky's property is equivalent to coprime coefficients.

As an example, the pair of polynomials n and n2+2 violates this condition at p=3: for every n the product

n(n2+2)

is divisible by 3, which follows from the representation

n(n2+2)=6(n3)+6(n2)+3(n1)

with respect to the binomial basis, where the highest common factor of the coefficients—hence the highest fixed divisor of n(n2+2)—is 3.

Other rings

Numerical polynomials can be defined over other rings and fields, in which case the integer-valued polynomials above are referred to as classical numerical polynomials.[citation needed]

Applications

The K-theory of BU(n) is numerical (symmetric) polynomials.[clarification needed]

The Hilbert polynomial of a polynomial ring in k + 1 variables is the numerical polynomial (t+kk).

References

  1. ↑ The values this polynomial takes are precisely the triangular numbers.

Sources

  • Baker, Andrew; Clarke, Francis; Ray, Nigel; Schwartz, Lionel (1989). "On the Kummer congruences and the stable homotopy of BU". Transactions of the American Mathematical Society. 316 (2): 385–432. JSTOR 2001355. MR 0942424.

Further reading