词条 | Generalized Appell polynomials |
释义 |
In mathematics, a polynomial sequence has a generalized Appell representation if the generating function for the polynomials takes on a certain form: where the generating function or kernel is composed of the series with and and all and with Given the above, it is not hard to show that is a polynomial of degree . Boas–Buck polynomials are a slightly more general class of polynomials. Special cases
Explicit representationThe generalized Appell polynomials have the explicit representation The constant is where this sum extends over all compositions of into parts; that is, the sum extends over all such that For the Appell polynomials, this becomes the formula Recursion relationEquivalently, a necessary and sufficient condition that the kernel can be written as with is that where and have the power series and Substituting immediately gives the recursion relation For the special case of the Brenke polynomials, one has and thus all of the , simplifying the recursion relation significantly. See also{{portal|Mathematics}}
References
1 : Polynomials |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。