Skolem problem

Unsolved problem in mathematics:
Is there an algorithm to test whether a constant-recursive sequence has a zero?
(more unsolved problems in mathematics)

In mathematics, the Skolem problem is the problem of determining whether the values of a constant-recursive sequence include the number zero. The problem can be formulated for recurrences over different types of numbers, including integers, rational numbers, and algebraic numbers. It is not known whether there exists an algorithm that can solve this problem.[1]

A linear recurrence relation expresses the values of a sequence of numbers as a linear combination of earlier values; for instance, the Fibonacci numbers may be defined from the recurrence relation

F(n) = F(n − 1) + F(n − 2)

together with the initial values F(0) = 0 and F(1) = 1. The Skolem problem is named after Thoralf Skolem, because of his 1933 paper proving the Skolem–Mahler–Lech theorem on the zeros of a sequence satisfying a linear recurrence with constant coefficients.[2] This theorem states that, if such a sequence has zeros, then with finitely many exceptions the positions of the zeros repeat regularly. Skolem proved this for recurrences over the rational numbers, and Mahler and Lech extended it to other systems of numbers. However, the proofs of the theorem do not show how to test whether there exist any zeros.

There does exist an algorithm to test whether a constant-recursive sequence has infinitely many zeros, and if so to construct a decomposition of the positions of those zeros into periodic subsequences, based on the algebraic properties of the roots of the characteristic polynomial of the given recurrence.[3] The remaining difficult part of the Skolem problem is determining whether the finite set of non-repeating zeros is empty or not.[1]

Partial solutions to the Skolem problem are known, covering the special case of the problem for recurrences of degree at most four. However, these solutions do not apply to recurrences of degree five or more.[1][4][5]

For integer recurrences, the Skolem problem is known to be NP-hard.[6]

References

  1. 1 2 3 Ouaknine, Joël; Worrell, James (2012), "Decision problems for linear recurrence sequences", Reachability Problems: 6th International Workshop, RP 2012, Bordeaux, France, September 17–19, 2012, Proceedings, Lecture Notes in Computer Science 7550, Heidelberg: Springer-Verlag, pp. 21–28, doi:10.1007/978-3-642-33512-9_3, MR 3040104.
  2. ↑ Skolem, Th. (1933), "Einige Sätze über gewisse Reihenentwicklungen und exponentiale Beziehungen mit Anwendung auf diophantische Gleichungen", Oslo Vid. akad. Skrifter I (6). Ouaknine & Worrell (2012) instead cite a 1934 paper of Skolem for this result.
  3. ↑ Berstel, Jean; Mignotte, Maurice (1976), "Deux propriétés décidables des suites récurrentes linéaires", Bulletin de la Société Mathématique de France (in French) 104 (2): 175–184, MR 0414475.
  4. ↑ Mignotte, M.; Shorey, T. N.; Tijdeman, R. (1984), "The distance between terms of an algebraic recurrence sequence", Journal für die Reine und Angewandte Mathematik 349: 63–76, MR 743965.
  5. ↑ Vereshchagin, N. K. (1985), "The problem of the appearance of a zero in a linear recursive sequence", Matematicheskie Zametki (in Russian) 38 (2): 177–189, 347, MR 808885.
  6. ↑ Blondel, Vincent D.; Portier, Natacha (2002), "The presence of a zero in an integer linear recurrent sequence is NP-hard to decide", Linear Algebra and its Applications, 351/352: 91–98, doi:10.1016/S0024-3795(01)00466-9, MR 1917474.

External links

This article is issued from Wikipedia - version of the Tuesday, April 12, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.