Skolem Problem for Linear Recurrence Sequences with 4 Dominant Roots (after Mignotte, Shorey, Tijdeman, Vereshchagin and Bacik)
Yuri Bilu
TL;DR
This paper reviews the decidability of the zero problem for linear recurrence sequences of order 4, summarizing key results from notable researchers in the field.
Contribution
It provides an exposition of existing work on the decidability of the vanishing problem for 4th-order linear recurrence sequences.
Findings
Decidability established for certain classes of 4th-order sequences
Summarizes key methods used in previous research
Highlights open problems in the field
Abstract
It is an exposition of the work of Mignotte, Shorey, Tijdeman, Vereshchagin and Bacik on decidability of the vanishing problem for linear recurrence sequences of order 4.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography · Urban Transport Systems Analysis