Restricted integer partition functions

preprint2012arXivOpen access

Abstract

For two sets AA and MM of positive integers and for a positive integer nn, let p(n,A,M)p(n,A,M) denote the number of partitions of nn with parts in AA and multiplicities in MM, that is, the number of representations of nn in the form n=∑a∈Amaan=\sum_{a \in A} m_a a where ma∈M∪0m_a \in M \cup {0} for all aa, and all numbers mam_a but finitely many are 0. It is shown that there are infinite sets AA and MM so that p(n,A,M)=1p(n,A,M)=1 for every positive integer nn. This settles (in a strong form) a problem of Canfield and Wilf. It is also shown that there is an infinite set MM and constants cc and n0n_0 so that for A=k!k≥1A={k!}_{k \geq 1} or for A={kk}k≥1A=\{k^k\}_{k \geq 1}, 0<p(n,A,M)≤nc0<p(n,A,M) \leq n^c for all n>n0n>n_0. This answers a question of Ljujić and Nathanson.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.