Numerical polynomial
In mathematics, a numerical polynomial is a polynomial with rational coefficients that takes integer values on integers. They are also called integer-valued polynomials.
They are objects of study in their own right in algebra, and are frequently used in algebraic topology.
Classification
Polynomials with integer coefficients are numerical polynomials, but they are not the only ones. Binomial coefficients, thought of as rational polynomials, are also numerical polynomials. For instance,
is numerical but does not have integer coefficients.
In fact, binomial coefficients generate numerical polynomials: every numerical polynomial is a unique integer linear combination of binomial coefficients, via the discrete Taylor series: binomial coefficients are numerical 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).
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.
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 .
References
Algebra
- Cahen, P-J.; Chabert, J-L. (1997), Integer-valued polynomials, Mathematical Surveys and Monographs, vol. 48, Providence, RI: American Mathematical Society
Algebraic topology
- A. Baker, F. Clarke, N. Ray, L. Schwartz (1989), "On the Kummer congruences and the stable homotopy of BU", Trans. Amer. Math. Soc., 316 (2): 385–432
{{citation}}: CS1 maint: multiple names: authors list (link)
- T. Ekedahl (2002), "On minimal models in integral homotopy theory", Homology Homotopy Appl., 4 (2): 191–218
- J. Hubbuck (1997), "Numerical forms", J. London Math. Soc. (2), 55 (1): 65–75