ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers rr and ss, let ck(r,s)c_k^{(r,s)} be the uniquely determined rational numbers, independent of nn, satisfying

∑k=0n(nk)r(n+kk)r=∑k=0n(nk)s(n+kk)sck(r,s).\sum_{k=0}^n{n\choose k}^r{n+k\choose k}^r=\sum_{k=0}^n{n\choose k}^s{n+k\choose k}^s c_k^{(r,s)}.

Finite integrality conjecture. For any s>1s>1 and n⩾0n\geqslant 0, there is an integer r>sr>s such that all the numbers ck(r,s)c_k^{(r,s)} for 0⩽k⩽n0\leqslant k\leqslant n are integers. This asks for arbitrarily long initial segments of the coefficient sequence to become integral after choosing a suitable exponent r>sr>s; the paper gives computational values for the least such rr when s=2s=2, but does not resolve the conjecture in general.

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.