Exponential formula explained

In combinatorial mathematics, the exponential formula (called the polymer expansion in physics) states that the exponential generating function for structures on finite sets is the exponential of the exponential generating function for connected structures.The exponential formula is a power series version of a special case of Faà di Bruno's formula.

Algebraic statement

Here is a purely algebraic statement, as a first introduction to the combinatorial use of the formula.

For any formal power series of the form$$f(x)=a\_1\; x+x^2+x^3+\backslash cdots+x^n+\backslash cdots\backslash ,$$we have$$\backslash exp\; f(x)=e^=\backslash sum\_^\backslash infty\; x^n,\backslash ,$$where$$b\_n\; =\; \backslash sum\_\; a\_\backslash cdots\; a\_,$$and the index

\pi runs through all partitions \{ S _{1,\ldots,S} _{k} \} of the set\{ 1 ,\ldots, n \} . (When k = 0 , the product is empty and by definition equals 1 .)

Formula in other expressions

One can write the formula in the following form:$$b\_n\; =\; B\_n(a\_1,a\_2,\backslash dots,a\_n),$$and thus$$\backslash exp\backslash left(\backslash sum\_^\backslash infty\; x^n\; \backslash right)\; =\; \backslash sum\_^\backslash infty\; x^n,$$where

B _{n(a} _{1,\ldots,a} _{n)} is the n th complete Bell polynomial.

Alternatively, the exponential formula can also be written using the cycle index of the symmetric group, as follows:$$\backslash exp\backslash left(\backslash sum\_^\backslash infty\; a\_n\; \backslash right)\; =\; \backslash sum\_^\backslash infty\; Z\_n(a\_1,\backslash dots,a\_n)\; x^n,$$where

Z _{n} stands for the cycle index polynomial for the symmetric group S _{n} , defined as:$$Z\_n\; (x\_1,\backslash cdots,x\_n)\; =\; \backslash frac\; 1\; \backslash sum\_\; x\_1^\backslash cdots\; x\_n^$$and \sigma _{j} denotes the number of cycles of \sigma of size j\in \{ 1 , … , n \} . This is a consequence of the general relation between Z _{n} and Bell polynomials:$$Z\_n(x\_1,\backslash dots,x\_n)\; =\; B\_n(0!\backslash ,x\_1,\; 1!\backslash ,x\_2,\; \backslash dots,\; (n-1)!\backslash ,x\_n).$$

Combinatorial interpretation

In combinatorial applications, the numbers

a _{n} count the number of some sort of "connected" structure on an n -point set, and the numbers b _{n} count the number of (possibly disconnected) structures. The numbers b _{n/n!} count the number of isomorphism classes of structures on n points, with each structure being weighted by the reciprocal of its automorphism group, and the numbers a _{n/n!} count isomorphism classes of connected structures in the same way.

Examples

b _{3} = B _{3(a} _{1,a} _{2,a} _{3)} = a _{3} + 3 a _{2} a _{1} + a ^{3 ,} _{1} because there is one partition of the set \{ 1 , 2 , 3 \} that has a single block of size 3 , there are three partitions of \{ 1 , 2 , 3 \} that split it into a block of size 2 and a block of size 1 , and there is one partition of \{ 1 , 2 , 3 \} that splits it into three blocks of size 1 . This also follows from Z _{3} (a _{1,a} _{2,a} _{3)} = { 1 \over 6 }( 2 a _{3} + 3 a _{1} a _{2} + a ^{3 )} _{1} = { 1 \over 6 } B _{3} (a _{1,} a _{2,} 2 a _{3)} , since one can write the group S _{3} as S _{3} = \{ ( 1 )( 2 )( 3 ), ( 1 )( 23 ), ( 2 )( 13 ), ( 3 )( 12 ), ( 123 ), ( 132 ) \} , using cyclic notation for permutations.

• If

b _{n} = 2 ^{n(n-1)/2} is the number of graphs whose vertices are a given n -point set, then a _{n} is the number of connected graphs whose vertices are a given n -point set.

• There are numerous variations of the previous example where the graph has certain properties: for example, if

b _{n} counts graphs without cycles, then a _{n} counts trees (connected graphs without cycles).

• If

b _{n} counts directed graphs whose (rather than vertices) are a given n point set, then a _{n} counts connected directed graphs with this edge set.Z , or more generally correlation functions, are given by a formal sum over Feynman diagrams. The exponential formula shows that ln (Z) can be written as a sum over connected Feynman diagrams, in terms of connected correlation functions.

References

• Chapter 5 page 3