ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let l≥1l\geq 1, let F∈C[x0,…,xl−1]F\in\mathbb{C}[x_0,\dots,x_{l-1}], and let {An}n≥0\{A_n\}_{n\geq 0} be a recurrence sequence satisfying

An+l=F(An,…,An+l−1)A_{n+l}=F(A_n,\dots,A_{n+l-1})

for all n≥0n\geq 0. The nonlinear 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 is a nonlinear analogue of the classical Skolem–Mahler–Lech theorem and is implied by the dynamical Mordell–Lang conjecture for a corresponding polynomial map; the paper notes it is known for l=2l=2 in the cited cases.

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.