ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let t:=n(n+1)t:=n(n+1), and define

g1(n):=1,gj(n):=j(j−1)!∏q=1j−1(jn+q)(j≥2).g_1(n):=1,\qquad g_j(n):=\frac{j}{(j-1)!}\prod_{q=1}^{j-1}(jn+q)\quad (j\geq 2).

Polynomial-factorization conjecture. There exist polynomials Pk(t,x)P_k(t,x) in xx of degree kk, with coefficients rationally depending on tt, such that

Sk,j(n)=tk+12k+1Pk(t,x)∣x=jgj(n).S_{k,j}(n)=\frac{t^{k+1}}{2^{k+1}}\left.P_k(t,x)\right|_{x=j}g_j(n).

The conjecture is the paper's main conjecture for the general sums; the source records explicit examples through k=7k=7 and notes that no recursion relation is known in general, although specialization at t=2t=2 recovers Tuenter's polynomials.

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.