ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s∈Zs\in\mathbb Z. The sequence (Pn(s,0))n≥1(P_n(s,0))_{n\geq 1} is called polynomially recurrent if it satisfies a polynomial recurrence in nn. Polynomial-recurrence conjecture. The sequence (Pn(s,0))n≥1(P_n(s,0))_{n\geq 1} is polynomially recurrent if and only if s∈{−1,0,1}s\in\{-1,0,1\}. The preceding non-holonomicity result applies only when t≠0t\neq 0, while for t=0t=0 one has P1(s,0)=1P_1(s,0)=1 and Pn(s,0)=sφ(n)P_n(s,0)=s^{\varphi(n)} for n≥2n\geq 2; the conjecture asks exactly which integer values of ss yield polynomial recurrence.

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.