{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:35:33Z","timestamp":1756190133555,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147876"},{"type":"electronic","value":"9783031147883"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14788-3_15","type":"book-chapter","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T14:24:42Z","timestamp":1660141482000},"page":"268-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Comparison of\u00a0Algorithms for\u00a0Proving Positivity of\u00a0Linearly Recurrent Sequences"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Nuspl","sequence":"first","affiliation":[]},{"given":"Veronika","family":"Pillwein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"15_CR1","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2003","unstructured":"Basu, S., Roy, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/968708.968710","volume":"37","author":"CW Brown","year":"2003","unstructured":"Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. SIGSAM Bull. 37(4), 97\u2013108 (2003)","journal-title":"SIGSAM Bull."},{"key":"15_CR3","series-title":"Texts & Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"BF Caviness","year":"1998","unstructured":"Caviness, B.F., Johnson, J.R.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symbolic Computation, Springer, Vienna (1998). https:\/\/doi.org\/10.1007\/978-3-7091-9459-1"},{"key":"15_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"2013","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-02945-9"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"GE Collins","year":"1991","unstructured":"Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12(3), 299\u2013328 (1991)","journal-title":"J. Symb. Comput."},{"key":"15_CR7","unstructured":"Olver, F.W.J., et al.: NIST Digital Library of Mathematical Functions. Release 1.1.0 of 2020\u201312-15 (2021). http:\/\/dlmf.nist.gov"},{"key":"15_CR8","series-title":"Mathematical Surveys and Monographs","volume-title":"Recurrence Sequences","author":"G Everest","year":"2015","unstructured":"Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, American Mathematical Society, Providence, USA (2015)"},{"key":"15_CR9","unstructured":"Gerhold, S.: Combinatorial Sequences: Non-Holonomicity and Inequalities. Ph.D. Thesis, Johannes Kepler University Linz (2005)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gerhold, S., Kauers, M.: A Procedure for proving special function inequalities involving a discrete parameter. In: Proceedings of ISSAC 2005, Beijing, China, 24\u201327 July 2005. pp. 156\u2013162 (2005)","DOI":"10.1145\/1073884.1073907"},{"issue":"1\u20133","key":"15_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(95)00133-H","volume":"153","author":"X Gourdon","year":"1996","unstructured":"Gourdon, X., Salvy, B.: Effective asymptotics of linear recurrences with rational coefficients. Discrete Math. 153(1\u20133), 145\u2013163 (1996)","journal-title":"Discrete Math."},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.dam.2005.10.009","volume":"154","author":"V Halava","year":"2006","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Positivity of second order linear recurrent sequences. Discrete Appl. Math. 154(3), 447\u2013451 (2006)","journal-title":"Discrete Appl. Math."},{"key":"15_CR13","unstructured":"Halava, V., Harju, T., Hirvensalo, M., Karhum\u00e4ki, J.: Skolem\u2019s Problem: On the Border Between Decidability and Undecidability. Technical Report (2005)"},{"key":"15_CR14","unstructured":"van der Hoeven, J.: Fuchsian holonomic sequences (2021). https:\/\/hal.archives-ouvertes.fr\/hal-03291372\/"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TC.2017.2690633","volume":"66","author":"F Johansson","year":"2017","unstructured":"Johansson, F.: Arb: efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Trans. Comput. 66, 1281\u20131292 (2017)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.jsc.2006.06.005","volume":"41","author":"M Kauers","year":"2006","unstructured":"Kauers, M.: SumCracker: a package for manipulating symbolic sums and related objects. J. Symb. Comput. 41(9), 1039\u20131057 (2006)","journal-title":"J. Symb. Comput."},{"key":"15_CR17","unstructured":"Kauers, M.: Computer algebra and power series with positive coefficients. In: Proceedings of FPSAC 2007, pp. 1\u20137 (2007)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kauers, M.: Bounds for D-finite closure properties. In: Proceedings of ISSAC 2014, Kobe, Japan, pp. 288\u2013295. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2608628.2608634"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kauers, M.: Algorithms for $$D$$-finite functions. In: JNCF 2015, Cluny, France (2015)","DOI":"10.1145\/2755996.2756658"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-15081-9_6","volume-title":"Computer Algebra and Polynomials: Applications of Algebra and Number Theory","author":"M Kauers","year":"2015","unstructured":"Kauers, M., Jaroschek, M., Johansson, F.: Ore polynomials in Sage. In: Computer Algebra and Polynomials: Applications of Algebra and Number Theory, pp. 105\u2013125. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15081-9_6"},{"key":"15_CR21","series-title":"Texts and Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-0445-3","volume-title":"The Concrete Tetrahedron","author":"M Kauers","year":"2011","unstructured":"Kauers, M., Paule, P.: The Concrete Tetrahedron. Texts and Monographs in Symbolic Computation, Springer, Vienna (2011). https:\/\/doi.org\/10.1007\/978-3-7091-0445-3"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Kauers, M., Pillwein, V.: When can we detect that a P-finite sequence is positive? In: Proceedings of ISSAC 2010, Munich, Germany, pp. 195\u2013201. Association for Computing Machinery, New York, NY, USA (2010)","DOI":"10.1145\/1837934.1837974"},{"issue":"15","key":"15_CR23","doi-asserted-by":"publisher","first-page":"3239","DOI":"10.1016\/j.dam.2009.06.021","volume":"157","author":"V Laohakosol","year":"2009","unstructured":"Laohakosol, V., Tangsupphathawat, P.: Positivity of third order linear recurrence sequences. Discrete Appl. Math. 157(15), 3239\u20133248 (2009)","journal-title":"Discrete Appl. Math."},{"key":"15_CR24","unstructured":"Li, H.C.: Studies on Generalized Vandermonde Matrices: Their Determinants, Inverses, Explicit LU Factorizations, with Applications. Ph.D. Thesis, National Chengchi University (2006)"},{"key":"15_CR25","unstructured":"Mallinger, C.: Algorithmic Manipulations and Transformations of Univariate Holonomic Functions and Sequences. Diplomarbeit, Johannes Kepler University Linz (1996)"},{"key":"15_CR26","first-page":"63","volume":"349","author":"M Mignotte","year":"1984","unstructured":"Mignotte, M., Shorey, T.N., Tijdeman, R.: The distance between terms of an algebraic recurrence sequence. J. f\u00fcr die reine und angewandte Mathematik 349, 63\u201376 (1984)","journal-title":"J. f\u00fcr die reine und angewandte Mathematik"},{"key":"15_CR27","unstructured":"OEIS Foundation Inc.: The On-Line Encyclopedia of Integer Sequences (2022). http:\/\/www.oeis.org"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Positivity problems for low-order linear recurrence sequences. In: SODA 2014: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 366\u2013379 (2014)","DOI":"10.1137\/1.9781611973402.27"},{"issue":"3","key":"15_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.aam.2007.12.001","volume":"41","author":"V Pillwein","year":"2008","unstructured":"Pillwein, V.: Positivity of certain sums over Jacobi kernel polynomials. Adv. Appl. Math. 41(3), 365\u2013377 (2008)","journal-title":"Adv. Appl. Math."},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Pillwein, V.: Termination conditions for positivity proving procedures. In: Proceedings of ISSAC 2013, Boston, USA, 26\u201329 June 2013. pp. 315\u2013322 (2013)","DOI":"10.1145\/2465506.2465945"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.aam.2018.11.003","volume":"104","author":"V Pillwein","year":"2019","unstructured":"Pillwein, V.: On the positivity of the Gillis-Reznick-Zeilberger rational function. Adv. Appl. Math. 104, 75\u201384 (2019)","journal-title":"Adv. Appl. Math."},{"key":"15_CR32","unstructured":"Stanley, R.P.: Enumerative Combinatorics: Vol. 2, Cambridge Studies in Advanced Mathematics, Cambridge University Press (1999)"},{"key":"15_CR33","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.4) (2022). https:\/\/www.sagemath.org"},{"key":"15_CR34","unstructured":"Uray, M.J.: On proving inequalities by cylindrical algebraic decomposition. Annales Univ. Sci. Budapest. Sect. Comp, pp. 231\u2013252 (2020)"},{"issue":"2","key":"15_CR35","first-page":"609","volume":"38","author":"NK Vereshchagin","year":"1985","unstructured":"Vereshchagin, N.K.: Occurrence of zero in a linear recursive sequence. Mat. Zametki 38(2), 609\u2013615 (1985)","journal-title":"Mat. Zametki"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Yokoyama, K., Li, Z., Nemes, I.: Finding roots of unity among quotients of the roots of an integral polynomial. In: Proceedings of ISSAC 1995, Montreal, Quebec, Canada, 10\u201312 July 1995. pp. 85\u201389 (1995)","DOI":"10.1145\/220346.220357"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14788-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T04:14:35Z","timestamp":1727756075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14788-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147876","9783031147883"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14788-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}