On the Skolem problem and the Skolem conjecture
<p>It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences (LRS) over the integers, namely whether a given such sequence has a zero term (i.e., whether un = 0 for some n). A major breakthrough in the early 1980s established d...
| Päätekijät: | , , , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Kieli: | English |
| Julkaistu: |
Association for Computing Machinery
2022
|