Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Touchard polynomials
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Basic properties === The value at 1 of the ''n''th Touchard polynomial is the ''n''th [[Bell numbers|Bell number]], i.e., the number of [[partition of a set|partitions of a set]] of size ''n'': :<math>T_n(1)=B_n.</math> If ''X'' is a [[random variable]] with a [[Poisson distribution]] with expected value Ξ», then its ''n''th moment is E(''X''<sup>''n''</sup>) = ''T''<sub>''n''</sub>(Ξ»), leading to the definition: :<math>T_{n}(x)=e^{-x}\sum_{k=0}^\infty \frac {x^k k^n} {k!}.</math> Using this fact one can quickly prove that this [[polynomial sequence]] is of [[binomial type]], i.e., it satisfies the sequence of identities: :<math>T_n(\lambda+\mu)=\sum_{k=0}^n {n \choose k} T_k(\lambda) T_{n-k}(\mu).</math> The Touchard polynomials constitute the only polynomial sequence of binomial type with the coefficient of ''x'' equal 1 in every polynomial. The Touchard polynomials satisfy the Rodrigues-like formula: :<math>T_n \left(e^x \right) = e^{-e^x} \frac{d^n}{dx^n}\;e^{e^x}.</math> The Touchard polynomials satisfy the [[recurrence relation]] :<math>T_{n+1}(x)=x \left(1+\frac{d}{dx} \right)T_{n}(x)</math> and :<math>T_{n+1}(x)=x\sum_{k=0}^n{n \choose k}T_k(x).</math> In the case ''x'' = 1, this reduces to the recurrence formula for the [[Bell numbers]]. A generalization of both this formula and the definition, is a generalization of Spivey's formula<ref>{{Cite web |title=Implications of Spivey's Bell Number Formula |url=https://cs.uwaterloo.ca/journals/JIS/VOL11/Gould/gould35.html |access-date=2023-05-28 |website=cs.uwaterloo.ca}}</ref> <math display="block">T_{n+m}(x) = \sum_{k=0}^n \left\{ {n \atop k} \right\} x^k \sum_{j=0}^m \binom{m}{j} k^{m-j} T_j(x)</math> Using the [[Umbral calculus|umbral notation]] ''T''<sup>''n''</sup>(''x'')=''T''<sub>''n''</sub>(''x''), these formulas become: :<math>T_n(\lambda+\mu)=\left(T(\lambda)+T(\mu) \right)^n,</math>{{clarification needed|date=April 2024}} :<math>T_{n+1}(x)=x \left(1+T(x) \right)^n.</math> The [[generating function]] of the Touchard polynomials is :<math>\sum_{n=0}^\infty {T_n(x) \over n!} t^n=e^{x\left(e^t-1\right)},</math> which corresponds to the [[Stirling numbers of the second kind#Generating functions|generating function of Stirling numbers of the second kind]]. Touchard polynomials have [[contour integral]] representation: :<math>T_n(x)=\frac{n!}{2\pi i}\oint\frac{e^{x({e^t}-1)}}{t^{n+1}}\,dt.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)