skip to main content
LOTERRE

LOTERRE

Mathematics (thesaurus)

Choisissez le vocabulaire dans lequel chercher

Langue des données

| español English
Aide à la recherche

Concept information

mathematical analysis > calculus > series > generating function
mathematical analysis > combinatorics > generating function
algebra > combinatorics > generating function

Terme préférentiel

generating function  

Définition(s)

  • In mathematics, a generating function is a way of encoding an infinite sequence of numbers (an) 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)

Concept(s) générique(s)

Concept(s) spécifique(s)

Concept(s) associé(s)

Traductions

URI

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

Télécharger ce concept:

RDF/XML TURTLE JSON-LD Date de création 22/08/2023, dernière modif. 22/08/2023