English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let q be an odd positive integer and P \in F2[z] be of order q and such thatP(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 numberof partitions of n with parts in A. In [5], it is proved that if A(P, x) is thecounting function of the set A(P) then A(P, x) << x(log x)^{-r/\phi(q)}, wherer is the order of 2 modulo q and \phi is Euler's function. In this paper, weimprove on the constant c=c(q) for which A(P,x) << x(log x)^{-c}.

On the counting function of sets with even partition functions