Conjecture on recurrence orders and coefficient polynomials for power sums
Conjecture on recurrence orders and coefficient polynomials for power sums
Let be a positive integer, and let denote the corresponding power-sum sequence satisfying a linear recurrence
Recurrence and coefficient conjecture. The linear recurrence corresponding to has order , and each coefficient is a linear polynomial in . 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
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
Sign in to submit a solution.
The exact-order assertion is false, although the affine-coefficient assertion is true.
Take , and write . The defining transfer system yields, for every admissible and every ,
These are exactly the six coefficients printed in the source's row; its purported seventh coefficient is explicitly . Thus the recurrence has order at most six, although the conjecture predicts
Moreover, six is the exact minimal order. At , the first eleven values are
Their Hankel determinant is
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 . If denotes its -th column, then
Hence
and the homogeneous characteristic annihilator
gives an eventual recurrence of order at most . Equality need not hold, as shows.
Finally, homogenizing the affine transfer recurrence gives the augmented matrix
The -dependent perturbation has rank one, so determinant multilinearity makes affine in . The same holds after removing its initial powers of . Thus all resulting characteristic recurrence coefficients have degree at most one in , proving the conjecture's second assertion while disproving its first.