Exponent of an infinite sum expansion

Sum over unordered sets

Exponent of an infinite sum can be expanded for all small like this

(1)

Sum over partitions

One can also start from expanding exponents of different separately

(2)

Now the multi‐index can be identified with the partition (Young diagram)

(3)

where is the number of parts of size . Hence

(4)

This expansion can be explicitly taken up to some fixed size of the partition (sym_factor and par_mon are defined here):

R = PolynomialRing(QQ, "t", 4 + 1)
t = R.gens()

S = sum(par_mon(par, t)/sym_factor(par)
        for n in range(4 + 1)
        for par in Partitions(n))
S
(5)

One can also make a quick sanity check (see here), by directly doing the expansion of exponent.

Equivalence of two expansions

Expansions above are equivalent due to multinomial theorem

(6)

where

(7)

is a “multinomial coefficient”.

Symmetric functions notation

When dealing with symmetric functions it’s quite natural to work in variables . In these variables we have

(8)

where are cycle type permutation centralizer sizes.