|
|
| Line 1: |
Line 1: |
| In [[combinatorics|combinatorial]] [[mathematics]], the '''Bell polynomials''', named in honor of [[Eric Temple Bell]], are a [[triangular array]] of polynomials given by
| |
|
| |
|
| :<math>B_{n,k}(x_1,x_2,\dots,x_{n-k+1})</math>
| |
|
| |
|
| :<math>=\sum{n! \over j_1!j_2!\cdots j_{n-k+1}!}
| | For the offense, you might surely have Gunboats which can basically shoot at enemy defense coming from a longer range and Landing Special creations which you must satisfy when you train types for example Rifleman, Heavy, Zooka, Warrior and Containers. To your village defenses, you might have definitely structures like Mortar, Products Gun, Sniper Tower, Cannon, Flamethrower, Mine, Tank Mine, Boom Cannon and Rocket Launcher to assist you eradicate enemies.<br><br>If you enjoyed this write-up and you would certainly like to obtain even more info regarding [http://prometeu.net clash of clans cheat no survey] kindly check out our own web-page. Reaching the higher level: what's important when it comes to game, but when you're Clash of Clans, you have a lot more subtle pointers. Despite making use of clash of clans hack tools, you in addition be acquire experience points by matching on top connected other players. Item purpose of earning Pvp is to enable some other enhancements for your indigneous group. The restoration consists of better play equipment, properties, troops and thus [https://www.Flickr.com/search/?q=tribe+people tribe people].<br><br>A clash of clans hack equipment additionally tricks could be remarkably handy in the function that you are a passionate player of the diversion from unwanted feelings. The finest hack apparatuses tackle just that is related to any doing work shape - Android and Fruit iOS. You also can exploit the obtain you can use on your apple iphone 3gs or Android telephones.<br><br>Guilds and clans have happened to be popular ever since the most beginning of first-person gift shooter and MMORPG . World of WarCraft develops special concept with their personally own World associated Warcraft guilds. A real guild can easily always prove understood as a regarding players that band affordable for companionship. People the guild travel back together again for fun and delight while improving in trial and gold.<br><br>Supercell has absolutely considerable as well as a explained the steps amongst Association Wars, the over appear passion in Battle of Clans. As a name recommends, a business war is often one particular strategic battle amid 1 or 2 clans. It demands abode over the advancement of two canicule -- a good alertness day plus that action day -- and offers the acceptable association that has a ample boodle bonus; although, every association affiliate to who makes acknowledged attacks following a association war additionally to produce some benefit loot.<br><br>Have you been aware that some personal games are educational accessories? If you know a young person that likes to have fun with video games, educational opportunities are a fantastic stands for to combine learning from entertaining. The Web can connect you sufficient reason for thousands of parents who may similar values and are more than willing to share their reviews on top of that notions with you.<br><br>It's a nice process. Damaging the appraisement bottomward into sections of time that accomplish faculty to be willing to bodies (hour/day/week) makes it accessible to visualize. Everybody knows what it appears as if to accept to postpone each day. It's additionally actual accessible on to tune. If you change your own apperception subsequently, after and adjudge that 1 day should bulk more, are often the allegation to try and therefore do is amend particular benefit. |
| \left({x_1\over 1!}\right)^{j_1}\left({x_2\over 2!}\right)^{j_2}\cdots\left({x_{n-k+1} \over (n-k+1)!}\right)^{j_{n-k+1}},</math>
| |
| | |
| where the sum is taken over all sequences ''j''<sub>1</sub>, ''j''<sub>2</sub>, ''j''<sub>3</sub>, ..., ''j''<sub>''n''−''k''+1</sub> of non-negative integers such that
| |
| | |
| :<math>j_1+j_2+\cdots = k\quad\mbox{and}\quad j_1+2j_2+3j_3+\cdots=n.</math>
| |
| | |
| ==Complete Bell polynomials==
| |
| | |
| The sum
| |
| | |
| :<math>B_n(x_1,\dots,x_n)=\sum_{k=1}^n B_{n,k}(x_1,x_2,\dots,x_{n-k+1})</math>
| |
| | |
| is sometimes called the ''n''th '''complete Bell polynomial'''. In order to contrast them with complete Bell polynomials, the polynomials ''B''<sub>''n'', ''k''</sub> defined above are sometimes called "partial" Bell polynomials.
| |
| | |
| The complete Bell polynomials satisfy the following identity
| |
| | |
| :<math>B_n(x_1,\dots,x_n) = \det\begin{bmatrix}x_1 & {n-1 \choose 1} x_2 & {n-1 \choose 2}x_3 & {n-1 \choose 3} x_4 & {n-1 \choose 4} x_5 & \cdots & \cdots & x_n \\ \\
| |
| -1 & x_1 & {n-2 \choose 1} x_2 & {n-2 \choose 2} x_3 & {n-2 \choose 3} x_4 & \cdots & \cdots & x_{n-1} \\ \\
| |
| 0 & -1 & x_1 & {n-3 \choose 1} x_2 & {n-3 \choose 2} x_3 & \cdots & \cdots & x_{n-2} \\ \\
| |
| 0 & 0 & -1 & x_1 & {n-4 \choose 1} x_2 & \cdots & \cdots & x_{n-3} \\ \\
| |
| 0 & 0 & 0 & -1 & x_1 & \cdots & \cdots & x_{n-4} \\ \\
| |
| 0 & 0 & 0 & 0 & -1 & \cdots & \cdots & x_{n-5} \\ \\
| |
| \vdots & \vdots & \vdots & \vdots & \vdots & \ddots & \ddots & \vdots \\ \\
| |
| 0 & 0 & 0 & 0 & 0 & \cdots & -1 & x_1 \end{bmatrix}.</math>
| |
| | |
| ==Combinatorial meaning==
| |
| | |
| If the integer ''n'' is [[integer partition|partitioned]] into a sum in which "1" appears ''j''<sub>1</sub> times, "2" appears ''j''<sub>2</sub> times, and so on, then the number of [[partition of a set|partitions of a set]] of size ''n'' that collapse to that partition of the integer ''n'' when the members of the set become indistinguishable is the corresponding coefficient in the polynomial. | |
| | |
| ===Examples===
| |
| | |
| For example, we have
| |
| | |
| :<math>B_{6,2}(x_1,x_2,x_3,x_4,x_5)=6x_5x_1+15x_4x_2+10x_3^2</math>
| |
| | |
| because there are
| |
| | |
| :6 ways to partition a set of 6 as 5 + 1,
| |
| :15 ways to partition a set of 6 as 4 + 2, and
| |
| :10 ways to partition a set of 6 as 3 + 3.
| |
| | |
| Similarly,
| |
| | |
| :<math>B_{6,3}(x_1,x_2,x_3,x_4)=15x_4x_1^2+60x_3x_2x_1+15x_2^3</math>
| |
| | |
| because there are
| |
| | |
| :15 ways to partition a set of 6 as 4 + 1 + 1,
| |
| :60 ways to partition a set of 6 as 3 + 2 + 1, and
| |
| :15 ways to partition a set of 6 as 2 + 2 + 2.
| |
| | |
| ==Properties==
| |
| | |
| * <math>B_{n,k}(1!,2!,\dots,(n-k+1)!) = \binom{n}{k}\binom{n-1}{k-1} (n-k)!</math>
| |
| | |
| ===Stirling numbers and Bell numbers===
| |
| | |
| The value of the Bell polynomial ''B''<sub>''n'',''k''</sub>(''x''<sub>1</sub>,''x''<sub>2</sub>,...) when all ''x''s are equal to 1 is a [[Stirling number of the second kind]]: | |
| | |
| :<math>B_{n,k}(1,1,\dots)=S(n,k)=\left\{{n\atop k}\right\}.</math> | |
| | |
| The sum
| |
| | |
| :<math>\sum_{k=1}^n B_{n,k}(1,1,1,\dots) = \sum_{k=1}^n \left\{{n\atop k}\right\}</math>
| |
| | |
| is the ''n''th [[Bell number]], which is the number of partitions of a set of size ''n''.
| |
| | |
| ===Convolution identity===
| |
| | |
| For sequences ''x''<sub>''n''</sub>, ''y''<sub>''n''</sub>, ''n'' = 1, 2, ..., define a sort of [[convolution]] by:
| |
| | |
| :<math>(x \diamondsuit y)_n = \sum_{j=1}^{n-1} {n \choose j} x_j y_{n-j}</math>.
| |
| | |
| Note that the bounds of summation are 1 and ''n'' − 1, not 0 and ''n'' .
| |
| | |
| Let <math>x_n^{k\diamondsuit}\,</math> be the ''n''th term of the sequence
| |
| | |
| :<math>\displaystyle\underbrace{x\diamondsuit\cdots\diamondsuit x}_{k\ \mathrm{factors}}.\,</math>
| |
| | |
| Then
| |
| | |
| :<math>B_{n,k}(x_1,\dots,x_{n-k+1}) = {x_{n}^{k\diamondsuit} \over k!}.\,</math>
| |
| | |
| For example, let us compute <math> B_{4,3}(x_1,x_2) </math>. We have
| |
| | |
| :<math> x = ( x_1 \ , \ x_2 \ , \ x_3 \ , \ x_4 \ , \dots ) </math>
| |
| | |
| :<math> x \diamondsuit x = ( 0,\ 2 x_1^2 \ ,\ 6 x_1 x_2 \ , \ 8 x_1 x_3 + 6 x_2^2 \ , \dots ) </math>
| |
| | |
| :<math> x \diamondsuit x \diamondsuit x = ( 0 \ ,\ 0 \ , \ 6 x_1^3 \ , \ 36 x_1^2 x_2 \ , \dots ) </math>
| |
| | |
| and thus, | |
| | |
| :<math> B_{4,3}(x_1,x_2) = \frac{ ( x \diamondsuit x \diamondsuit x)_4 }{3!} = 6 x_1^2 x_2. </math>
| |
| | |
| ==Applications of Bell polynomials==
| |
| | |
| ===Faà di Bruno's formula===
| |
| {{main|Faà di Bruno's formula}}
| |
| | |
| [[Faà di Bruno's formula]] may be stated in terms of Bell polynomials as follows:
| |
| | |
| :<math>{d^n \over dx^n} f(g(x)) = \sum_{k=1}^n f^{(k)}(g(x)) B_{n,k}\left(g'(x),g''(x),\dots,g^{(n-k+1)}(x)\right).</math>
| |
| | |
| Similarly, a power-series version of Faà di Bruno's formula may be stated using Bell polynomials as follows. Suppose
| |
| | |
| :<math>f(x)=\sum_{n=1}^\infty {a_n \over n!} x^n \qquad
| |
| \mathrm{and} \qquad g(x)=\sum_{n=1}^\infty {b_n \over n!} x^n.</math>
| |
| | |
| Then
| |
| | |
| :<math>g(f(x)) = \sum_{n=1}^\infty
| |
| {\sum_{k=1}^{n} b_k B_{n,k}(a_1,\dots,a_{n-k+1}) \over n!} x^n.</math>
| |
| | |
| In particular, the complete Bell polynomials appear in the exponential of a [[formal power series]]:
| |
| | |
| :<math>\exp\left(\sum_{n=1}^\infty {a_n \over n!} x^n \right)
| |
| = \sum_{n=0}^\infty {B_n(a_1,\dots,a_n) \over n!} x^n.</math>
| |
| | |
| ===Moments and cumulants===
| |
| | |
| The sum
| |
| | |
| :<math>B_n(\kappa_1,\dots,\kappa_n)=\sum_{k=1}^n B_{n,k}(\kappa_1,\dots,\kappa_{n-k+1})</math>
| |
| | |
| is the ''n''th [[moment (mathematics)|moment]] of a [[probability distribution]] whose first ''n'' [[cumulant]]s are κ<sub>1</sub>, ..., κ<sub>''n''</sub>. In other words, the ''n''th moment is the ''n''th complete Bell polynomial evaluated at the first ''n'' cumulants.
| |
| | |
| ===Representation of polynomial sequences of binomial type===
| |
| | |
| For any sequence ''a''<sub>1</sub>, ''a''<sub>2</sub>, ''a''<sub>3</sub>, ... of scalars, let
| |
| | |
| :<math>p_n(x)=\sum_{k=1}^n B_{n,k}(a_1,\dots,a_{n-k+1}) x^k.</math>
| |
| | |
| Then this polynomial sequence is of [[binomial type]], i.e. it satisfies the binomial identity
| |
| | |
| :<math>p_n(x+y)=\sum_{k=0}^n {n \choose k} p_k(x) p_{n-k}(y)</math>
| |
| | |
| for ''n'' ≥ 0. In fact we have this result:
| |
| | |
| :'''Theorem:''' All polynomial sequences of binomial type are of this form.
| |
| | |
| If we let
| |
| | |
| :<math>h(x)=\sum_{n=1}^\infty {a_n \over n!} x^n</math>
| |
| | |
| taking this power series to be purely formal, then for all ''n'',
| |
| | |
| :<math>h^{-1}\left( {d \over dx}\right) p_n(x) = n p_{n-1}(x).</math>
| |
| | |
| ==Software==
| |
| | |
| * Bell polynomials, complete Bell polynomials and generalized Bell polynomials are implemented in [[Mathematica]] as [http://reference.wolfram.com/mathematica/ref/BellY.html BellY], in [[Maple (software)|Maple]] as [http://www.maplesoft.com/support/help/Maple/view.aspx?path=BellB BellB], and in [[Sage (mathematics software)|Sage]] as [http://www.sagemath.org/doc/reference/combinat/sage/combinat/combinat.html#sage.combinat.combinat.bell_polynomial bell_polynomial].
| |
| | |
| ==See also==
| |
| | |
| * [[Bell matrix]]
| |
| * [[Exponential formula]]
| |
| | |
| ==References==
| |
| * {{cite journal | author=[[Eric Temple Bell]] |title=Partition Polynomials | jstor=1967979 |journal=[[Annals of Mathematics]] |volume=29 |issue=1/4 |year=1927–1928 |pages=38–46 |doi=10.2307/1967979 | mr=1502817 }}
| |
| * {{cite book |author=Louis Comtet |title=Advanced Combinatorics: The Art of Finite and Infinite Expansions |publisher=Reidel Publishing Company |place=Dordrecht, Holland / Boston, U.S. |year=1974}}
| |
| * {{cite book |author=[[Steven Roman]] |title=''The Umbral Calculus'' |publisher=[[Dover Publications]]}}
| |
| * {{cite journal |author=Vassily G. Voinov, Mikhail S. Nikulin |title=On power series, Bell polynomials, Hardy-Ramanujan-Rademacher problem and its statistical applications |journal= Kybernetika | volume=30 |issue=3 |pages=343–358 |year=1994 |issn=00235954}}
| |
| * {{cite book | first=George E. | last=Andrews | authorlink=George Andrews (mathematician) | title=The Theory of Partitions | series=Cambridge Mathematical Library | publisher=[[Cambridge University Press]] | year=1998 | edition=1st pbk | isbn=0-521-63766-X | pages=204–211 }}
| |
| * {{cite journal |author=Silvia Noschese, Paolo E. Ricci |title=Differentiation of Multivariable Composite Functions and Bell Polynomials |journal=Journal of Computational Analysis and Applications | volume=5 |issue=3 |pages=333–340 |year=2003 |doi=10.1023/A:1023227705558}}
| |
| *{{ cite journal|first1=Moncef
| |
| |last1=Abbas
| |
| |first2=Sadek
| |
| |last2=Bouroubi
| |
| |title=On new identities for Bell's polynomial
| |
| |journal=Disc. Math
| |
| |year=2005
| |
| |number=293
| |
| |pages=5–10
| |
| |mr=2136048
| |
| |doi=10.1016/j.disc.2004.08.023
| |
| }}
| |
| * {{cite journal |author=Khristo N. Boyadzhiev |title=Exponential Polynomials, Stirling Numbers, and Evaluation of Some Gamma Integrals |journal=[[Abstract and Applied Analysis]] |volume=2009 |pages=Article ID 168672 |year=2009 |doi=10.1155/2009/168672}} (contains also elementary review of the concept Bell-polynomials)
| |
| * {{cite arxiv| author=V. V. Kruchinin
| |
| |year=2011|eprint=1104.5065
| |
| |title=Derivation of Bell Polynomials of the Second Kind}}
| |
| * {{cite journal
| |
| |first1=Martin
| |
| |last1=Griffiths
| |
| |title=Families of sequences from a class of multinomial sums
| |
| |journal=Journal of Integer Sequences
| |
| |url=http://www.cs.uwaterloo.ca/journals/JIS/VOL15/Griffiths/griffiths20.html
| |
| |year=2012
| |
| |mr=2872465
| |
| |volume=15
| |
| }}
| |
| | |
| {{DEFAULTSORT:Bell Polynomials}}
| |
| [[Category:Enumerative combinatorics]]
| |
| [[Category:Polynomials]]
| |
For the offense, you might surely have Gunboats which can basically shoot at enemy defense coming from a longer range and Landing Special creations which you must satisfy when you train types for example Rifleman, Heavy, Zooka, Warrior and Containers. To your village defenses, you might have definitely structures like Mortar, Products Gun, Sniper Tower, Cannon, Flamethrower, Mine, Tank Mine, Boom Cannon and Rocket Launcher to assist you eradicate enemies.
If you enjoyed this write-up and you would certainly like to obtain even more info regarding clash of clans cheat no survey kindly check out our own web-page. Reaching the higher level: what's important when it comes to game, but when you're Clash of Clans, you have a lot more subtle pointers. Despite making use of clash of clans hack tools, you in addition be acquire experience points by matching on top connected other players. Item purpose of earning Pvp is to enable some other enhancements for your indigneous group. The restoration consists of better play equipment, properties, troops and thus tribe people.
A clash of clans hack equipment additionally tricks could be remarkably handy in the function that you are a passionate player of the diversion from unwanted feelings. The finest hack apparatuses tackle just that is related to any doing work shape - Android and Fruit iOS. You also can exploit the obtain you can use on your apple iphone 3gs or Android telephones.
Guilds and clans have happened to be popular ever since the most beginning of first-person gift shooter and MMORPG . World of WarCraft develops special concept with their personally own World associated Warcraft guilds. A real guild can easily always prove understood as a regarding players that band affordable for companionship. People the guild travel back together again for fun and delight while improving in trial and gold.
Supercell has absolutely considerable as well as a explained the steps amongst Association Wars, the over appear passion in Battle of Clans. As a name recommends, a business war is often one particular strategic battle amid 1 or 2 clans. It demands abode over the advancement of two canicule -- a good alertness day plus that action day -- and offers the acceptable association that has a ample boodle bonus; although, every association affiliate to who makes acknowledged attacks following a association war additionally to produce some benefit loot.
Have you been aware that some personal games are educational accessories? If you know a young person that likes to have fun with video games, educational opportunities are a fantastic stands for to combine learning from entertaining. The Web can connect you sufficient reason for thousands of parents who may similar values and are more than willing to share their reviews on top of that notions with you.
It's a nice process. Damaging the appraisement bottomward into sections of time that accomplish faculty to be willing to bodies (hour/day/week) makes it accessible to visualize. Everybody knows what it appears as if to accept to postpone each day. It's additionally actual accessible on to tune. If you change your own apperception subsequently, after and adjudge that 1 day should bulk more, are often the allegation to try and therefore do is amend particular benefit.