Search results
Jump to navigation
Jump to search
- ...defined from [[analytic function]]s <math>B</math> and <math>C</math> by [[generating function]]s of the form ...last2=Buck | first2=R. Creighton | title=Polynomial expansions of analytic functions | url=https://books.google.com/books?id=eihMuwkh4DsC | publisher=[[Springer ...1,000 bytes (138 words) - 06:57, 13 May 2024
- ...</sub>, which are special cases of [[generalized Appell polynomials]] with generating function of the form ...e | first1=W. C. | authorlink=William Charles Brenke | title=On generating functions of polynomial systems | mr=0012720 | year=1945 | journal=[[American Mathema ...2 KB (292 words) - 03:24, 4 June 2024
- ===Ordinary generating functions=== It is also possible to demonstrate the theorem through the use of [[ordinary generating function]]s of the binomial distribution: ...4 KB (700 words) - 10:46, 11 November 2023
- ...me{\delta}_{n,m}</math> is the [[Kronecker delta function]] and the weight functions are ==Generating functions== ...5 KB (770 words) - 06:33, 13 May 2024
- ...'''primitive recursive set functions''' or '''primitive recursive ordinal functions''' are analogs of [[primitive recursive function]]s, defined for [[Set (mat ...function]] from sets to sets that can be obtained from the following basic functions by repeatedly applying the following rules of substitution and recursion: ...5 KB (658 words) - 07:34, 24 December 2022
- ==Generating function== [[Category:Special hypergeometric functions]] ...3 KB (381 words) - 16:18, 10 November 2022
- ==Generating functions== The continuous Hahn polynomials have the following generating function:<ref>Koekoek, Lesky, & Swarttouw (2010), p. 202.</ref> ...6 KB (974 words) - 17:52, 9 April 2019
- * Panholzer and Prodinger's proof via [[generating functions]]; | title = A generating functions proof of a curious identity ...3 KB (419 words) - 15:09, 2 February 2024
- ...oblem in [[combinatorics|combinatorial]] [[mathematics]] that involves a [[generating function]]. In this problem, a ''fountain'' is an arrangement of non-overla ...oblem is then given by the coefficients of the polynomial of the following generating function: ...5 KB (879 words) - 09:36, 13 February 2025
- ...) are polynomials introduced by {{harvtxt|Rainville|1945}} given by the [[generating function]] ...last2=Buck | first2=R. Creighton | title=Polynomial expansions of analytic functions | url=https://books.google.com/books?id=eihMuwkh4DsC | publisher=[[Springer ...1 KB (128 words) - 06:13, 4 June 2024
- ===Ordinary generating functions=== ...polynomials allows to give simple equations for the [[ordinary generating functions]] (OGF) of many natural questions. ...7 KB (1,170 words) - 23:13, 18 August 2023
- {{Short description|Generating pseudo-random numbers that follow a probability distribution}} ...dom number sampling''' is the [[Numerical analysis|numerical]] practice of generating [[pseudo-random number]]s (PRN) that follow a given [[probability distribut ...7 KB (865 words) - 16:27, 24 December 2024
- ...sion is to be made. We require a proof which will not appeal to generating functions, . . . ".<ref name=Dyson/> Dyson introduced the idea of rank of a partition == Generating functions == ...12 KB (1,599 words) - 01:51, 7 January 2025
- ...uerre polynomials]] introduced by {{harvtxt|Denisyuk|1954}} given by the [[generating function]]{{sfnp|Boas|Buck|1958|p=41}} |title = Polynomial expansions of analytic functions ...1 KB (145 words) - 07:25, 8 February 2025
- ...quence to express formulas for the series coefficients of a given ordinary generating function. ...notation for coefficient extraction usually applied to formal [[generating functions]] in some complex variable, by denoting <math>[n^{-s}] D_f(s) =: f(n)</math ...16 KB (2,720 words) - 06:06, 2 March 2025
- == Generating functions == Then, the [[probability generating function]], [[moment generating function]] and [[characteristic function]] are given, respectively, by:<ref ...7 KB (1,200 words) - 10:15, 17 January 2025
- ...totic estimates]] for the coefficients of [[Generating_function|generating functions]].<ref>Melczer 2021, pp. vii and ix.</ref><ref>Pemantle and Wilson 2013, pp ...on#Bivariate_and_multivariate_generating_functions|multivariate generating functions]] started in the 1970s using probabilistic methods.<ref>Melczer 2021, pp. 1 ...8 KB (1,184 words) - 11:27, 22 February 2025
- ...mbert|year=1921|authorlink=Pierre Humbert (mathematician)}} given by the [[generating function]] ...last2=Buck | first2=R. Creighton | title=Polynomial expansions of analytic functions | url=https://books.google.com/books?id=eihMuwkh4DsC | publisher=[[Springer ...1 KB (143 words) - 04:52, 4 June 2024
- ...ed case, where we have a set of labelled objects given by an [[exponential generating function]] (EGF) ''g''(''z'') which are being distributed into ''n'' slots ...the functions <math>f_n(z)</math> can be further combined into a single [[generating function]]: ...5 KB (878 words) - 01:18, 14 January 2024
- ...ynomials also have a representation in terms of generalized hypergeometric functions, namely ===Generating function=== ...5 KB (707 words) - 15:52, 4 January 2024