{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:49Z","timestamp":1750306609768,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T00:00:00Z","timestamp":1423094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2015,2,5]]},"abstract":"<jats:p>We discuss some changes of the traditional scheme for finding rational solutions of linear difference equations (homogeneous or inhomogeneous) with rational coefficients. These changes in some cases allow one to detect the absence of rational solutions in an early stage of computation and to stop the work. The corresponding strategy may be useful for the algorithms based on finding rational solutions of equations of considered form, e.g., for some symbolic summation algorithms.<\/jats:p>","DOI":"10.1145\/2733693.2733697","type":"journal-article","created":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T13:19:47Z","timestamp":1423574387000},"page":"90-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Detecting Nonexistence of Rational Solutions of Linear Difference Equations in Early Stages of Computation"],"prefix":"10.1145","volume":"48","author":[{"given":"Amal","family":"Gheffar","sequence":"first","affiliation":[{"name":"XLIM, Universit\u00e9 de Limoges, Limoges cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,2,5]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"273","volume":"21","author":"Abramov S.","year":"1995","journal-title":"Programming and Comput. Software"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/281508.281593"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1893832.1893834"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/10652469908819212"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1940475.1940525"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.75.1.40"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/281508.281592"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190413"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80044-2"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2733693.2733697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2733693.2733697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:02Z","timestamp":1750227422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2733693.2733697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,5]]},"references-count":9,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2015,2,5]]}},"alternative-id":["10.1145\/2733693.2733697"],"URL":"https:\/\/doi.org\/10.1145\/2733693.2733697","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2015,2,5]]},"assertion":[{"value":"2015-02-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}