On the Skolem problem and the Skolem conjecture

DOI10.1145/3531130.3533328MaRDI QIDQ6649433

Florian Luca, Unnamed Author, David Purser, James Worrell, Richard B. Lipton, Joël Ouaknine

Publication date: 6 December 2024

zbMATH Keywords

decidabilitySkolem problemlinear recurrence sequencesSkolem conjectureexponential local-global principle

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Recurrences (11B37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability problems for Markov chains
• \(p\)-adic numbers: An introduction.
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• A Hasse-type principle for exponential Diophantine equations over number fields and its applications
• A Hasse-type principle for exponential Diophantine equations and its applications
• Abelian binomials, power residues and exponential congruences
• Zwei Sätze über Gleichungen mit ganzzahligen Coefficienten.
• Decision Problems for Linear Recurrence Sequences
• On the exponential local-global principle
• Universal equivalence and majority of probabilistic programs over finite fields
• On the decidability of reachability in linear time-invariant systems
• The Polyhedron-Hitting Problem
• Approximate Verification of the Symbolic Dynamics of Markov Chains
• Sur les séries entières à coefficients entiers.
• A survey of computational complexity results in systems and control

This page was built for publication: On the Skolem problem and the Skolem conjecture