Restricted integer partition functions

Publication date 25 October 2013

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.3317, http://www.emis.de/journals/INTEGERS/papers/n16/n16.Abstract.html

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

zbMATH Keywords

growth integer partition representation function

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Distribution of integers with specified multiplicative constraints (11N25) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

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.

Review text

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\), i.e., the number of representations of \(n\) in the form \(n=\sum_{a\in A} m_a\cdot a\) with \(m_a\in M\cup\{0\}\). \textit{E. R. Canfield} and \textit{H. S. Wilf} [Developments in Mathematics 23, 39--46 (2012; Zbl 1242.05018)] raised the following question. Do there exist two infinite sets \(A\) and \(M\) so that \(p(n,A,M)> 0\) for all sufficiently large \(n\) and yet \(p\) has polynomial growth? \textit{Ž. Ljujić} and \textit{M. B. Nathanson} [Integers 12, No. 6, 1279--1286, A11 (2012; Zbl 1272.11111)] showed that this cannot be the case if \(|A\cap\{1, 2,\dots, n\}|\geq\delta\log n\) for all sufficiently large \(n\), where \(\delta>0\) is any constant, and therefore they specialized the above question for \(A= \{k!\}^\infty_{k=1}\) and \(A= \{k^k\}^\infty_{k=1}\).NEWLINENEWLINE In the paper under review the author answers the original question positively in the strongest possible way: there are infinite sets \(A\) and \(M\) so that \(p(n,A,M)= 1\) for all \(n\). He also answers the specialized questions positively in the following more general form: Let \(A\) be an infinite set of positive integers with \(1\in A\) and \(|A\cap\{1,2,\dots, n\}|= (1+ 0(1)){\log n\over\log\log n}\), where the \(0(1)\) term tends to \(0\) and \(n\) tends to infinity. Then there exists \(n_0\) and an infinite set \(M\) of positive integers so that \(0< p(n,A,M)< n^{8+0(1)}\) for all \(n>n_0\).

Recommendations

Cited in

(8)

This page was built for publication: Restricted integer partition functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855590)