On the counting function of the sets of parts \(\mathcal A\) such that the partition function \(p(\mathcal {A},n)\) takes even values for \(n\) large enough (Q2497489): Difference between revisions

Let \({\mathcal A}\) be a set of positive integers, and let \(p({\mathcal A},n)\) be the number of partitions of \(n\) with parts in \({\mathcal A}\). It is known that there exists a unique set \({\mathcal A}(f)\subset\mathbb{N}\) such that \(p({\mathcal A}(f),n)\equiv \varepsilon_n\bmod 2\) for \(n=1,2,\dots\) where \(\varepsilon_i\in\{0,1\}\) and \(f(z)=\sum^\infty_{n=0}\varepsilon_n z^n\). In this paper, the authors studied the counting function of the sets \({\mathcal A}(P)\) (that is the cardinality of the set \(\{a:a\leq x,a\in{\mathcal A}(P) \})\) and gave some general estimates when \(P\) is a polynomial with coefficients zero or one.