ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let

ρ(q)=∑n≥0r(n)qn\rho(q)=\sum_{n\geq 0}r(n)q^n

be defined by

ρ(q)=∑m≥0q2m(m+1)(1+q+q2)(1+q3+q6)⋯(1+q2m+1+q4m+2).\rho(q)=\sum_{m\geq 0}\frac{q^{2m(m+1)}}{(1+q+q^2)(1+q^3+q^6)\cdots(1+q^{2m+1}+q^{4m+2})}.

The finite sign law. For every n≥0n\geq 0,

r(3n)>0,r(3n)>0, r(3n+1)≤0,r(3n+1)\leq 0,

and

r(3n+2)≤0.r(3n+2)\leq 0.

Moreover, the only zeros in the last two families are

r(2)=r(4)=r(8)=r(11)=r(20)=0.r(2)=r(4)=r(8)=r(11)=r(20)=0.

The asymptotic version is proved in the paper, but determining the exact finite cutoff remains separate; the stated finite law is supported experimentally and is not established by the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.