Integer-valued polynomial

Last updated November 01, 2023

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

Classification

The class of integer-valued polynomials was described fully by GeorgePólya ( 1915 ). Inside the polynomial ring $\mathbb {Q} [t]$ of polynomials with rational number coefficients, the subring of integer-valued polynomials is a free abelian group. It has as basis the polynomials

P_{k}(t)=t(t-1)\cdots (t-k+1)/k!

for $k=0,1,2,\dots$ , 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 such that $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 a matter of basic importance 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 $n^{2}+2$ violates this condition at $p=3$ : for every $n$ the product

n(n^{2}+2)

is divisible by 3, which follows from the representation

n(n^{2}+2)=6{\binom {n}{3}}+6{\binom {n}{2}}+3{\binom {n}{1}}

with respect to the binomial basis, where the highest common factor of the coefficients—hence the highest fixed divisor of $n(n^{2}+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.

The Hilbert polynomial of a polynomial ring in k + 1 variables is the numerical polynomial ${\binom {t+k}{k}}$ .

Related Research Articles

In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers $n \geq k \geq 0$ and is written $It is the coefficient of the x k term in the polynomial expansion of the binomial power (1 + x) n; this coefficient can be computed by the multiplicative formula$

In mathematics, a polynomial is an expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate $x$ is $x 2 - 4 x + 7$ . An example with three indeterminates is $x 3 + 2 xyz 2 - yz + 1$ .

<span class="mw-page-title-main">Factorization</span> (Mathematical) decomposition into a product

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, $3 \times 5$ is an integer factorization of $15$ , and $(x - 2)(x + 2)$ is a polynomial factorization of $x 2 - 4$ .

In mathematics, Stirling numbers arise in a variety of analytic and combinatorial problems. They are named after James Stirling, who introduced them in a purely algebraic setting in his book Methodus differentialis (1730). They were rediscovered and given a combinatorial meaning by Masanobu Saka in 1782.

In mathematics, the falling factorial is defined as the polynomial

In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered:

A monomial, also called power product, is a product of powers of variables with nonnegative integer exponents, or, in other words, a product of variables, possibly with repetitions. For example, $is a monomial. The constant is a monomial, being equal to the empty product and to for any variable . If only a single variable is considered, this means that a monomial is either or a power of, with a positive integer. If several variables are considered, say, then each can be given an exponent, so that any monomial is of the form with non-negative integers.$
A monomial is a monomial in the first sense multiplied by a nonzero constant, called the coefficient of the monomial. A monomial in the first sense is a special case of a monomial in the second sense, where the coefficient is $. For example, in this interpretation and are monomials.$

In mathematics, the double factorial of a number $n$ , denoted by $n ‼$ , is the product of all the positive integers up to $n$ that have the same parity as $n$ . That is,

In mathematics, a pyramid number, or square pyramidal number, is a natural number that counts the number of stacked spheres in a pyramid with a square base. The study of these numbers goes back to Archimedes and Fibonacci. They are part of a broader topic of figurate numbers representing the numbers of points forming regular patterns within different shapes.

<span class="mw-page-title-main">Daubechies wavelet</span> Orthogonal wavelets

The Daubechies wavelets, based on the work of Ingrid Daubechies, are a family of orthogonal wavelets defining a discrete wavelet transform and characterized by a maximal number of vanishing moments for some given support. With each wavelet type of this class, there is a scaling function which generates an orthogonal multiresolution analysis.

In mathematics, Schinzel's hypothesis H is one of the most famous open problems in the topic of number theory. It is a very broad generalization of widely open conjectures such as the twin prime conjecture. The hypothesis is named after Andrzej Schinzel.

In abstract algebra, a discrete valuation ring (DVR) is a principal ideal domain (PID) with exactly one non-zero maximal ideal.

In combinatorics, Vandermonde's identity is the following identity for binomial coefficients:

In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems.

In commutative algebra, the Hilbert function, the Hilbert polynomial, and the Hilbert series of a graded commutative algebra finitely generated over a field are three strongly related notions which measure the growth of the dimension of the homogeneous components of the algebra.

In mathematics, a univariate polynomial of degree $n$ with real or complex coefficients has $n$ complex roots, if counted with their multiplicities. They form a multiset of $n$ points in the complex plane. This article concerns the geometry of these points, that is the information about their localization in the complex plane that can be deduced from the degree and the coefficients of the polynomial.

The Bunyakovsky conjecture gives a criterion for a polynomial $in one variable with integer coefficients to give infinitely many prime values in the sequence It was stated in 1857 by the Russian mathematician Viktor Bunyakovsky. The following three conditions are necessary for to have the desired prime-producing property:$

the leading coefficient is positive,
the polynomial is irreducible over the rationals, and
the values $have no common factor.$

In mathematics, the Schuette–Nesbitt formula is a generalization of the inclusion–exclusion principle. It is named after Donald R. Schuette and Cecil J. Nesbitt.

In mathematics, a binomial ring is a commutative ring whose additive group is torsion-free and contains all binomial coefficients

In mathematics, the telephone numbers or the involution numbers form a sequence of integers that count the ways $n$ people can be connected by person-to-person telephone calls. These numbers also describe the number of matchings of a complete graph on $n$ vertices, the number of permutations on $n$ elements that are involutions, the sum of absolute values of coefficients of the Hermite polynomials, the number of standard Young tableaux with $n$ cells, and the sum of the degrees of the irreducible representations of the symmetric group. Involution numbers were first studied in 1800 by Heinrich August Rothe, who gave a recurrence equation by which they may be calculated, giving the values

In algebra, a Landau-Mignotte bound (sometimes only referred to as Mignotte's bound) is one of a family of inequalities concerning a univariate integer polynomial f(x) and one of its factors h(x). A basic version states that the coefficients of h(x) are bounded independently of h(x) by an exponential expression involving only the degree and coefficients of f(x), i.e. only depending on f(x).

References

↑ Johnson, Keith (2014), "Stable homotopy theory, formal group laws, and integer-valued polynomials", in Fontana, Marco; Frisch, Sophie; Glaz, Sarah (eds.), Commutative Algebra: Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions, Springer, pp. 213–224, ISBN 9781493909254 . See in particular pp. 213–214.

Algebra

Cahen, Paul-Jean; Chabert, Jean-Luc (1997), Integer-valued polynomials, Mathematical Surveys and Monographs, vol. 48, Providence, RI: American Mathematical Society, MR 1421321
Pólya, George (1915), "Über ganzwertige ganze Funktionen", Palermo Rend. (in German), 40: 1–16, ISSN 0009-725X, JFM 45.0655.02

Algebraic topology

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, doi:10.2307/2001355, JSTOR 2001355, MR 0942424

Ekedahl, Torsten (2002), "On minimal models in integral homotopy theory", Homology, Homotopy and Applications , 4 (2): 191–218, doi: 10.4310/hha.2002.v4.n2.a9 , MR 1918189, Zbl 1065.55003

Elliott, Jesse (2006). "Binomial rings, integer-valued polynomials, and λ-rings". Journal of Pure and Applied Algebra . 207 (1): 165–185. doi: 10.1016/j.jpaa.2005.09.003 . MR 2244389.

Hubbuck, John R. (1997), "Numerical forms", Journal of the London Mathematical Society , Series 2, 55 (1): 65–75, doi:10.1112/S0024610796004395, MR 1423286