ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Dk(x)D_k(x) be the Delannoy polynomial, defined by

Dk(x)=∑j=0k(kj)(k+jj)xj.D_k(x)=\sum_{j=0}^{k}{k\choose j}{k+j\choose j}x^j.

Let xx be an integer and let pp be an odd prime. The mod-p3p^3 refinement.

∑k=0p−1(−1)k(2k+1)Dk(x)4≡p∑k=0p−12(−1)k(2kk)2(x2+x)k(2x+1)2k(modp3).\sum_{k=0}^{p-1}(-1)^k(2k+1)D_k(x)^4 \equiv p\sum_{k=0}^{\frac{p-1}{2}}(-1)^k{2k\choose k}^2(x^2+x)^k(2x+1)^{2k}\pmod{p^3}.

The paper proves the corresponding congruence modulo p2p^2 and presents this stronger modulus-p3p^3 version as a numerical conjecture.

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.