On the counting function of sets with even partition functions
Number Theory
2012-05-08 v3
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}.
Cite
@article{arxiv.1101.4557,
title = {On the counting function of sets with even partition functions},
author = {Fethi Ben Said and Jean-Louis Nicolas},
journal= {arXiv preprint arXiv:1101.4557},
year = {2012}
}