Loterre: Matemáticas: generating function

mathematical analysis > calculus > series > generating function

mathematical analysis > combinatorics > generating function

algebra > combinatorics > generating function

generating function

In mathematics, a generating function is a way of encoding an infinite sequence of numbers ( $a n$ ) by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Generating_function)

http://data.loterre.fr/ark:/67375/PSR-D7VZQ60F-N

RDF/XML TURTLE JSON-LD Creado 22/8/23, última modificación 22/8/23

LOTERRE