On the counting function of sets with even partition functions
From MaRDI portal
Abstract: Let q be an odd positive integer and P in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying sum_{n=0}^infty p(A, n) z^n equiv P(z) (mod 2), where p(A,n) is the number of partitions of n with parts in A. In [5], it is proved that if A(P, x) is the counting function of the set A(P) then A(P, x) << x(log x)^{-r/phi(q)}, where r is the order of 2 modulo q and phi is Euler's function. In this paper, we improve on the constant c=c(q) for which A(P,x) << x(log x)^{-c}.
Recommendations
- 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
- ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON
- On some sets with even partition functions
- scientific article; zbMATH DE number 1995938
- On the parity of generalized partition functions. III
Cited in
(9)- On some sets with even partition functions
- 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
- Sets with even partition functions and cyclotomic numbers
- scientific article; zbMATH DE number 1933061 (Why is no real title available?)
- scientific article; zbMATH DE number 1995938 (Why is no real title available?)
- ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON
- Semi-colored partitions
- On the elements of sets with even partition function
- Sets with even partition functions and 2-adic integers
This page was built for publication: On the counting function of sets with even partition functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898868)
