Conjecture on recurrence orders and coefficient polynomials for power sums

From papers

Let kk be a positive integer, and let (sk)n(s^k)_n denote the corresponding power-sum sequence satisfying a linear recurrence

(sk)n=j=1cj(q)(sk)nj.(s^k)_n=\sum_{j=1}c_j(q)(s^k)_{n-j}.

Recurrence and coefficient conjecture. The linear recurrence corresponding to kk has order k/2+3\left\lfloor k/2\right\rfloor+3, and each coefficient cj(q)c_j(q) is a linear polynomial in qq. This conjecture summarizes the patterns observed in the computed recurrence coefficients; the supplied text gives no evidence that either assertion has been proved or disproved.

Progress summary

Open

No public discussion or published progress on this conjecture was found.

No public discussion or published progress relevant to this conjecture was found.

Current status (as of August 2026): The conjecture appears open, with no recorded public activity establishing or refuting either assertion.

Sources & referencesView supporting material

Primary source

László Németh and László Szalay, “Power sums in hyperbolic Pascal triangles”, arXiv:1703.04938 (2017).

Solutions 1

Counterexample

The exact-order assertion is false, although the affine-coefficient assertion is true.

Take k=9k=9, and write Sn=(s9)nS_n=(s^9)_n. The defining transfer system yields, for every admissible q5q\ge5 and every n7n\ge7,

Sn=(q+62)Sn1+(447q+1288)Sn2+(2433q15116)Sn3+(105552431q)Sn4+(3662450q)Sn5450Sn6.\begin{aligned} S_n={}&(q+62)S_{n-1}+(447q+1288)S_{n-2} +(2433q-15116)S_{n-3}\\ &+(10555-2431q)S_{n-4} +(3662-450q)S_{n-5}-450S_{n-6}. \end{aligned}

These are exactly the six coefficients printed in the source's k=9k=9 row; its purported seventh coefficient is explicitly c7(q)=0c_7(q)=0. Thus the recurrence has order at most six, although the conjecture predicts

92+3=7.\left\lfloor\frac92\right\rfloor+3=7.

Moreover, six is the exact minimal order. At q=5q=5, the first eleven values are

2, 514, 39880, 4470930, 438529598, 45014063550, 4547625234042, 461974238315026, 46840025812751018, 4752325523662690738, 482052722208599420434.2,\ 514,\ 39880,\ 4470930,\ 438529598,\ 45014063550,\ 4547625234042,\ 461974238315026,\ 46840025812751018,\ 4752325523662690738,\ 482052722208599420434.

Their Hankel determinant is

det(Si+j+1)0i,j<6=223322597731710.\det(S_{i+j+1})_{0\le i,j<6} =-2^{23}3^{22}5^97^7\cdot31\cdot71\ne0.

Any recurrence of order at most five would make this determinant vanish. Consequently the minimal order is exactly six, not seven.

A corrected general statement also follows directly from the source transfer matrix Mk(q)M_k(q). If CjC_j denotes its jj-th column, then

Cj=Ckj(1j<k),2Ck+1=j=1k1Cj.C_j=C_{k-j}\quad(1\le j<k), \qquad 2C_{k+1}=\sum_{j=1}^{k-1}C_j.

Hence

rankMk(q)k2+2,\operatorname{rank}M_k(q)\le\left\lfloor\frac k2\right\rfloor+2,

and the homogeneous characteristic annihilator

(X1)det(XIMk(q))(X-1)\det(XI-M_k(q))

gives an eventual recurrence of order at most k/2+3\lfloor k/2\rfloor+3. Equality need not hold, as k=9k=9 shows.

Finally, homogenizing the affine transfer recurrence gives the augmented matrix

A(q)=A(0)+q(ek+ek+1)(e0T+ekT2ek+2T).A(q)=A(0)+q(e_k+e_{k+1}) (e_0^{\mathsf T}+e_k^{\mathsf T}-2e_{k+2}^{\mathsf T}).

The qq-dependent perturbation has rank one, so determinant multilinearity makes det(XIA(q))\det(XI-A(q)) affine in qq. The same holds after removing its initial powers of XX. Thus all resulting characteristic recurrence coefficients have degree at most one in qq, proving the conjecture's second assertion while disproving its first.

0 endorsements
Shivam Patel ·