Formal power series

related topics
{math, number, function}

In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions.

Contents

Full article ▸

related documents
Lebesgue integration
Banach–Tarski paradox
Red-black tree
Lambda calculus
P-adic number
Determinant
Big O notation
Travelling salesman problem
Binomial coefficient
Discrete cosine transform
Grothendieck topology
Linear programming
Combinatory logic
Pythagorean triple
Relational model
Original proof of Gödel's completeness theorem
Μ-recursive function
Prolog
System of linear equations
Group theory
Riemann integral
Laplace transform
Wikipedia:Free On-line Dictionary of Computing/R - S
Quadratic reciprocity
Spinor
Lie group
Combinatorics
Class (computer science)
Dedekind domain
Orthogonal matrix