Spt function

From testwiki
Jump to navigation Jump to search

The spt function (smallest parts function) is a function in number theory that counts the sum of the number of smallest parts in each integer partition of a positive integer. It is related to the partition function.[1]

The first few values of spt(n) are:

1, 3, 5, 10, 14, 26, 35, 57, 80, 119, 161, 238, 315, 440, 589 ... Template:OEIS

Example

For example, there are five partitions of 4 (with smallest parts underlined):

Template:Underline
3 + Template:Underline
Template:Underline + Template:Underline
2 + Template:Underline + Template:Underline
Template:Underline + Template:Underline + Template:Underline + Template:Underline

These partitions have 1, 1, 2, 2, and 4 smallest parts, respectively. So spt(4) = 1 + 1 + 2 + 2 + 4 = 10.

Properties

Like the partition function, spt(n) has a generating function. It is given by

S(q)=n=1spt(n)qn=1(q)n=1qnm=1n1(1qm)1qn

where (q)=n=1(1qn).

The function S(q) is related to a mock modular form. Let E2(z) denote the weight 2 quasi-modular Eisenstein series and let η(z) denote the Dedekind eta function. Then for q=e2πiz, the function

S~(z):=q1/24S(q)112E2(z)η(z)

is a mock modular form of weight 3/2 on the full modular group SL2() with multiplier system χη1, where χη is the multiplier system for η(z).

While a closed formula is not known for spt(n), there are Ramanujan-like congruences including

spt(5n+4)0mod(5)
spt(7n+5)0mod(7)
spt(13n+6)0mod(13).

References

Template:Reflist


Template:Numtheory-stub Template:Combin-stub