ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let l≥1l\geq 1, let g,ai∈C(x)g,a_i\in\mathbb{C}(x) for i=0,…,l−1i=0,\dots,l-1, and let α∈C\alpha\in\mathbb{C} satisfy ai(gn(α))≠∞a_i(g^n(\alpha))\neq\infty for every i=0,…,l−1i=0,\dots,l-1 and n≥0n\geq 0. Let {An}n≥0\{A_n\}_{n\geq 0} be a recurrence sequence satisfying

An+l=∑i=0l−1ai(gn(α))An+iA_{n+l}=\sum_{i=0}^{l-1}a_i(g^n(\alpha))A_{n+i}

for all n≥0n\geq 0. The dynamically varying-coefficient Skolem–Mahler–Lech conjecture. The zero set

{n≥0∣An=0}\{n\geq 0\mid A_n=0\}

is a union of at most finitely many arithmetic progressions. This generalizes the classical theorem by allowing coefficients generated along an orbit of a rational function; its status is left open in the source.

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.