ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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)n−j.(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.

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.