{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:37Z","timestamp":1750306117427,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T00:00:00Z","timestamp":1487721600000},"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":[[2017,2,22]]},"abstract":"<jats:p>In his pioneering work [1, 2], Michael Karr introduced \u03a0\u03a3-fields which provide a rather general framework for symbolic summation. He worked out the first algorithmic steps to represent indefinite nested sums and products as transcendental extensions over a computable ground field K called the field of constants. Furthermore, he presented an algorithm that solves the parameterized telescoping problem, and as special cases the telescoping and creative telescoping problems [3] within a given \u03a0\u03a3-field.<\/jats:p>","DOI":"10.1145\/3055282.3055290","type":"journal-article","created":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T13:06:52Z","timestamp":1488200812000},"page":"161-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Representation of hypergeometric products in difference rings"],"prefix":"10.1145","volume":"50","author":[{"given":"Evans Doe","family":"Ocansey","sequence":"first","affiliation":[{"name":"Johannes Kepler University, Linz"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Schneider","sequence":"additional","affiliation":[{"name":"Johannes Kepler University, Linz"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322255"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(85)80038-9"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80044-2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2014.12"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.02.002"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-005-0242-2"},{"key":"e_1_2_1_7_1","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0096118","volume-title":"Galois Theory of Difference Equations","author":"van der Put Marius","year":"1997","unstructured":"Marius van der Put and Michael F. Singer . Galois Theory of Difference Equations , volume 1666 of Lecture Notes in Mathematics ., Springer-Verlag , Berlin , 1997 . Marius van der Put and Michael F. Singer. Galois Theory of Difference Equations, volume 1666 of Lecture Notes in Mathematics., Springer-Verlag, Berlin,1997."},{"key":"e_1_2_1_8_1","volume-title":"Summation Theory II: Characterizations of R\u03a0\u03a3*-Extensions and Algorithmic Aspects. J. Symbolic Comput., in press","author":"Schneider Carsten","year":"2016","unstructured":"Carsten Schneider . Summation Theory II: Characterizations of R\u03a0\u03a3*-Extensions and Algorithmic Aspects. J. Symbolic Comput., in press , 2016 . Carsten Schneider. Summation Theory II: Characterizations of R\u03a0\u03a3*-Extensions and Algorithmic Aspects. J. Symbolic Comput., in press, 2016."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930945"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.03.001"},{"key":"e_1_2_1_13_1","first-page":"4","volume":"28","author":"Bauer Andrej","year":"1999","unstructured":"Andrej Bauer and Marko Petkov\u0161ek . Multibasic and Mixed Hypergeometric Gosper-Type Algorithms. J. Symbolic Comput. , 28 :( 4 -- 5 ):711--736, October , 1999 . Andrej Bauer and Marko Petkov\u0161ek. Multibasic and Mixed Hypergeometric Gosper-Type Algorithms. J. Symbolic Comput., 28:(4--5):711--736, October, 1999.","journal-title":"Comput."},{"key":"e_1_2_1_14_1","volume-title":"Symbolic Summation Assists Combinatorics. S\u00e9m. Lothar. Combin., 56:1--36","author":"Schneider Carsten","year":"2007","unstructured":"Carsten Schneider . Symbolic Summation Assists Combinatorics. S\u00e9m. Lothar. Combin., 56:1--36 , 2007 . Article B 56b. Carsten Schneider. Symbolic Summation Assists Combinatorics. S\u00e9m. Lothar. Combin., 56:1--36, 2007. Article B56b."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.08.005"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055282.3055290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055282.3055290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:37Z","timestamp":1750217797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055282.3055290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,22]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,2,22]]}},"alternative-id":["10.1145\/3055282.3055290"],"URL":"https:\/\/doi.org\/10.1145\/3055282.3055290","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2017,2,22]]},"assertion":[{"value":"2017-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}