Restricted integer partition functions

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Abstract: For two sets

A

and

M

of positive integers and for a positive integer

n

, let

p (n, A, M)

denote the number of partitions of

n

with parts in

A

and multiplicities in

M

, that is, the number of representations of

n

in the form

n = s u m_{a i n A} m_{a} a

where

m_{a} i n M c u p 0

for all

a

, and all numbers

m_{a}

but finitely many are 0. It is shown that there are infinite sets

A

and

M

so that

p (n, A, M) = 1

for every positive integer

n

. This settles (in a strong form) a problem of Canfield and Wilf. It is also shown that there is an infinite set

M

and constants

c

and

n_{0}

so that for

A = {k!}_{k g e q 1}

or for

A = {k^{k}}_{k g e q 1}

,

0 < p (n, A, M) l e q n^{c}

for all

n > n_{0}

. This answers a question of Ljuji'c and Nathanson.

Recommendations

Cited in

(8)

This page was built for publication: Restricted integer partition functions