Numerical polynomial

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.

Contents

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,

\binom{n}{2} = \frac{n(n-1)}{2} = \frac{1}{2}n^2 - \frac{1}{2}n

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).

See binomial coefficient#Binomial coefficients as a basis for the space of polynomials for more information.

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 \binom{t+k}{k}.

References

Algebra

  • Cahen, P-J.; Chabert, J-L. (1997), Integer-valued polynomials, Mathematical Surveys and Monographs, 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. (Transactions of the American Mathematical Society, Vol. 316, No. 2) 316 (2): 385–432, doi:10.2307/2001355, JSTOR 2001355 

Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Numerical integration — consists of finding numerical approximations for the value S In numerical analysis, numerical integration constitutes a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also… …   Wikipedia

  • Numerical continuation — is a method of computing approximate solutions of a system of parameterized nonlinear equations, The parameter λ is usually a real scalar, and the solution an n vector. For a fixed parameter value λ,, maps Euclidean n space into itself. Often the …   Wikipedia

  • numerical analysis — the branch of mathematics dealing with methods for obtaining approximate numerical solutions of mathematical problems. [1925 30] * * * Branch of applied mathematics that studies methods for solving complicated equations using arithmetic… …   Universalium

  • Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… …   Wikipedia

  • Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… …   Wikipedia

  • Numerical smoothing and differentiation — An experimental datum value can be conceptually described as the sum of a signal and some noise, but in practice the two contributions cannot be separated. The purpose of smoothing is to increase the Signal to noise ratio without greatly… …   Wikipedia

  • Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states …   Wikipedia

  • Numerical sign problem — The numerical sign problem refers to the difficulty of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near cancellation of the positive and negative… …   Wikipedia

  • Numerical analysis — Babylonian clay tablet BC 7289 (c. 1800–1600 BC) with annotations. The approximation of the square root of 2 is four sexagesimal figures, which is about six decimal figures. 1 + 24/60 + 51/602 + 10/603 = 1.41421296...[1] Numerical analysis is the …   Wikipedia

  • Numerical semigroup — In mathematics, a numerical semigroup is a special kind of a semigroup. Its underlying set is the set of all nonnegative integers except a finite number and the binary operation is the operation of addition of integers. Also, the integer 0 must… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”