{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:17Z","timestamp":1778497937435,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_28","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"330-341","source":"Crossref","is-referenced-by-count":15,"title":["Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Amoroso, F., Viada, E.: Small points on subvarieties of a torus. Duke Mathematical Journal\u00a0150(3) (2009)","DOI":"10.1215\/00127094-2009-056"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bell, J.P., Gerhold, S.: On the positivity set of a linear recurrence. Israel Jour. Math.\u00a057 (2007)","DOI":"10.1007\/s11856-006-0015-1"},{"issue":"40-42","key":"28_CR3","doi-asserted-by":"publisher","first-page":"3625","DOI":"10.1016\/j.tcs.2010.06.005","volume":"411","author":"P. Bell","year":"2010","unstructured":"Bell, P., Delvenne, J.-C., Jungers, R., Blondel, V.: The continuous Skolem-Pisot problem. Theor. Comput. Sci.\u00a0411(40-42), 3625\u20133634 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Berstel, J., Mignotte, M.: Deux propri\u00e9t\u00e9s d\u00e9cidables des suites r\u00e9currentes lin\u00e9aires. Bull. Soc. Math. France 104 (1976)","DOI":"10.24033\/bsmf.1823"},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/S0097539703425861","volume":"34","author":"V. Blondel","year":"2005","unstructured":"Blondel, V., Jeandel, E., Koiran, P., Portier, N.: Decidable and undecidable problems about quantum automata. SIAM J. Comput.\u00a034(6), 1464\u20131473 (2005)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S0005-1098(00)00050-9","volume":"36","author":"V. Blondel","year":"2000","unstructured":"Blondel, V., Tsitsiklis, J.: A survey of computational complexity results in systems and control. Automatica\u00a036(9), 1249\u20131274 (2000)","journal-title":"Automatica"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of STOC 1988, pp. 460\u2013467. ACM (1988)","DOI":"10.1145\/62212.62257"},{"key":"28_CR9","unstructured":"Cassels, J.: An introduction to Diophantine approximation. Camb. Univ. Pr. (1965)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. American Mathematical Society (2003)","DOI":"10.1090\/surv\/104"},{"issue":"2","key":"28_CR11","first-page":"225","volume":"53","author":"J.-H. Evertse","year":"1984","unstructured":"Evertse, J.-H.: On sums of S-units and linear recurrences. Compositio Mathematica\u00a053(2), 225\u2013244 (1984)","journal-title":"Compositio Mathematica"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Evertse, J.-H., Schlickewei, H.P., Schmidt, W.M.: Linear equations in variables which lie in a multiplicative group. Ann. Math.\u00a0155(3) (2002)","DOI":"10.2307\/3062133"},{"key":"28_CR13","unstructured":"Fr\u00f6hlich, A., Taylor, M.: Algebraic Number Theory. Camb. Univ. Press (1993)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Positivity of second order linear recurrent sequences. Discrete Applied Mathematics 154(3) (2006)","DOI":"10.1016\/j.dam.2005.10.009"},{"key":"28_CR15","unstructured":"Halava, V., Harju, T., Hirvensalo, M., Karhum\u00e4ki, J.: Skolem\u2019s problem \u2013 on the border between decidability and undecidability. Technical Report 683, Turku Centre for Computer Science (2005)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. JACM 33(4) (1986)","DOI":"10.1145\/6490.6496"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Laohakosol, V., Tangsupphathawat, P.: Positivity of third order linear recurrence sequences. Discrete Applied Mathematics 157(15) (2009)","DOI":"10.1016\/j.dam.2009.06.021"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Lech, C.: A note on recurring series. Ark. Mat. 2 (1953)","DOI":"10.1007\/BF02590997"},{"key":"28_CR19","unstructured":"Mahler, K.: Eine arithmetische Eigenschaft der Taylor Koeffizienten rationaler Funktionen. Proc. Akad. Wet. Amsterdam 38 (1935)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Masser, D.W.: Linear relations on algebraic groups. In: New Advances in Transcendence Theory. Camb. Univ. Press (1988)","DOI":"10.1017\/CBO9780511897184.016"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Mignotte, M., Shorey, T., Tijdeman, R.: The distance between terms of an algebraic recurrence sequence. J. f\u00fcr die reine und angewandte Math. 349 (1984)","DOI":"10.1515\/crll.1984.349.63"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-33512-9_3","volume-title":"Reachability Problems","author":"J. Ouaknine","year":"2012","unstructured":"Ouaknine, J., Worrell, J.: Decision problems for linear recurrence sequences. In: Finkel, A., Leroux, J., Potapov, I. (eds.) RP 2012. LNCS, vol.\u00a07550, pp. 21\u201328. Springer, Heidelberg (2012)"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Ultimate Positivity is decidable for simple linear recurrence sequences. CoRR, abs\/1309.1914 (2013)","DOI":"10.1137\/1.9781611973402.27"},{"key":"28_CR24","series-title":"LNCS","volume-title":"ICALP 2014, Part II","author":"J. Ouaknine","year":"2014","unstructured":"Ouaknine, J., Worrell, J.: On the Positivity Problem for simple linear recurrence sequences. In: Esparza, J., Fraigniaud, P., Husfeldt, T. (eds.) ICALP 2014, Part II. LNCS, vol.\u00a08573, Springer, Heidelberg (2014); CoRR, abs\/1309.1550"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Positivity problems for low-order linear recurrence sequences. In: Proceedings of SODA 2014. ACM-SIAM (2014)","DOI":"10.1137\/1.9781611973402.27"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. J. Symb. Comp. (1992)","DOI":"10.1016\/S0747-7171(10)80005-7"},{"key":"28_CR27","unstructured":"Rozenberg, G., Salomaa, A.: Cornerstones of Undecidability. Prentice Hall (1994)"},{"key":"28_CR28","unstructured":"Skolem, T.: Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen. In: Comptes rendus du congr\u00e8s des math\u00e9maticiens scandinaves (1934)"},{"key":"28_CR29","unstructured":"Soittola, M.: On D0L synthesis problem. In: Lindenmayer, A., Rozenberg, G. (eds.) Automata, Languages, Development. North-Holland (1976)"},{"key":"28_CR30","unstructured":"Tao, T.: Structure and randomness: pages from year one of a mathematical blog. American Mathematical Society (2008)"},{"key":"28_CR31","unstructured":"van der Poorten, A., Schlickewei, H.: The growth conditions for recurrence sequences. Macquarie Math. Reports (82-0041) (1982)"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Vereshchagin, N.K.: The problem of appearance of a zero in a linear recurrence sequence. Mat. Zametki 38(2) (1985) (in Russian)","DOI":"10.1007\/BF01156238"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T17:45:23Z","timestamp":1649353523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}