{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:30:07Z","timestamp":1775017807155,"version":"3.50.1"},"reference-count":49,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1134\/s0361768820020103","type":"journal-article","created":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T19:02:46Z","timestamp":1587236566000},"page":"133-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimal Representations and Algebraic Relations for Single Nested Products"],"prefix":"10.1134","volume":"46","author":[{"given":"Carsten","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"7119_CR1","doi-asserted-by":"crossref","unstructured":"Ablinger, J., Behring, A., Bl\u00fcmlein, J., Freitas, A.D., von Manteuffel, A., and Schneider, C., Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra, Comput. Phys. Comm., 2016, vol. 202, pp. 33\u2013112. arXiv:1509.08324 [hep-ph].","DOI":"10.1016\/j.cpc.2016.01.002"},{"key":"7119_CR2","unstructured":"Ablinger, J., Bl\u00fcmlein, J., Freitas, A.D., Goedicke, A., Schneider, C., and Sch\u00f6nwald, K., The two-mass contribution to the three-loop gluonic operator matrix element $$A_{{gg,Q}}^{{(3)}}$$, Nucl. Phys. B, 2018, vol. 932, pp. 129\u2013240. arXiv:1804.02226 [hep-ph]."},{"key":"7119_CR3","first-page":"1071","volume":"11","author":"S.A. Abramov","year":"1971","unstructured":"Abramov, S.A., On the summation of rational functions, Zh. Vychisl. Mat. Fiz., 1971, vol. 11, pp. 1071\u20131074.","journal-title":"Zh. Vychisl. Mat. Fiz."},{"key":"7119_CR4","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0041-5553(75)90181-0","volume":"15","author":"S.A. Abramov","year":"1975","unstructured":"Abramov, S.A., The rational component of the solution of a first-order linear recurrence relation with a rational right-hand side, USSR Comput. Math. Math. Phys., 1975, vol. 15, pp. 216\u2013221.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"7119_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0041-5553(89)80002-3","volume":"29","author":"S.A. Abramov","year":"1989","unstructured":"Abramov, S.A., Rational solutions of linear differential and difference equations with polynomial coefficients, USSR Comput. Math. Math. Phys., 1989, vol. 29, no. 6, pp. 7\u201312.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"7119_CR6","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.jsc.2010.03.001","volume":"45","author":"S.A. Abramov","year":"2010","unstructured":"Abramov, S.A. and Petkov\u0161ek, M., Polynomial ring automorphisms, rational $$(w,\\sigma )$$-canonical forms, and the assignment problem, J. Symb. Comput., 2010, vol. 45, no. 6, pp. 684\u2013708.","journal-title":"J. Symb. Comput."},{"key":"7119_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.aam.2005.09.003","volume":"37","author":"M. Apagodu","year":"2006","unstructured":"Apagodu M. and Zeilberger, D., Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory, Adv. Appl. Math., 2006, vol. 37, pp. 139\u2013152.","journal-title":"Adv. Appl. Math."},{"key":"7119_CR8","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1006\/jsco.1999.0321","volume":"28","author":"A. Bauer","year":"1999","unstructured":"Bauer A. and Petkov\u0161ek, M., Multibasic and mixed hypergeometric Gosper-type algorithms, J. Symb. Comput., 1999, vol. 28, no. 4\u20135, pp. 711\u2013736.","journal-title":"J. Symb. Comput."},{"key":"7119_CR9","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1006\/jsco.2000.0368","volume":"29","author":"M. Bronstein","year":"2000","unstructured":"Bronstein, M., On solutions of linear ordinary difference equations in their coefficient field, J. Symb. Comput., 2000, vol. 29, no. 6, pp. 841\u2013877.","journal-title":"J. Symb. Comput."},{"key":"7119_CR10","doi-asserted-by":"crossref","unstructured":"Chen, S. and Kauers, M., Order-degree curves for hypergeometric creative telescoping, in Proc. ISSAC 2012, van der Hoeven, J. and van Hoeij, M., Eds., 2012, pp. 122\u2013129.","DOI":"10.1145\/2442829.2442850"},{"key":"7119_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00259-9","volume":"217","author":"F. Chyzak","year":"2000","unstructured":"Chyzak, F., An extension of Zeilberger\u2019s fast algorithm to general holonomic functions, Discrete Math., 2000, vol. 217, pp. 115\u2013134.","journal-title":"Discrete Math."},{"key":"7119_CR12","volume-title":"Algebra","author":"P.M. Cohn","year":"1989","unstructured":"Cohn, P.M., Algebra, 2nd ed., John Wiley & Sons, 1989, vol. 2."},{"key":"7119_CR13","volume-title":"Difference Algebra","author":"R.M. Cohn","year":"1965","unstructured":"Cohn, R.M., Difference Algebra, John Wiley & Sons, 1965."},{"key":"7119_CR14","doi-asserted-by":"crossref","unstructured":"Elsheikh, M., Giesbrecht, M., Novocin, A., and Saunders, B.D., Fast computation of Smith forms of sparse matrices over local rings, in Proc. ISSAC 2012, New York: ACM, 2012, pp. 146\u2013153.","DOI":"10.1145\/2442829.2442853"},{"key":"7119_CR15","unstructured":"Ge, G., Algorithms related to the multiplicative representation of algebraic numbers, PhD Thesis, Univ. of California at Berkeley, 1993."},{"key":"7119_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1073\/pnas.75.1.40","volume":"75","author":"R.W. Gosper","year":"1978","unstructured":"Gosper, R.W., Decision procedures for indefinite hypergeometric summation, Proc. Nat. Acad. Sci. USA, 1978, vol. 75, pp. 40\u201342.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"7119_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00208-008-0238-z","volume":"342","author":"C. Hardouin","year":"2008","unstructured":"Hardouin, C. and Singer, M., Differential Galois theory of linear difference equations, Math. Ann., 2008, vol. 342, no. 2, pp. 333\u2013377.","journal-title":"Math. Ann."},{"key":"7119_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1145\/322248.322255","volume":"28","author":"M. Karr","year":"1981","unstructured":"Karr, M., Summation in finite terms, J. ACM, 1981, vol. 28, pp. 305\u2013350.","journal-title":"J. ACM"},{"key":"7119_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0747-7171(85)80038-9","volume":"1","author":"M. Karr","year":"1985","unstructured":"Karr, M., Theory of summation in finite terms, J. Symb. Comput., 1985, vol. 1, pp. 303\u2013315.","journal-title":"J. Symb. Comput."},{"key":"7119_CR20","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.jsc.2008.03.002","volume":"43","author":"M. Kauers","year":"2008","unstructured":"Kauers, M. and Zimmermann, B., Computing the algebraic relations of c-finite sequences and multisequences, J. Symb. Comput., 2008, vol. 43, no. 11, pp. 787\u2013803.","journal-title":"J. Symb. Comput."},{"key":"7119_CR21","doi-asserted-by":"crossref","unstructured":"Koutschan, C., Creative telescoping for holonomic functions, in Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, Schneider, C. and Bl\u00fcmlein, J., Eds., Springer, 2013, pp. 171\u2013194. arXiv:1307.4554 [cs.SC].","DOI":"10.1007\/978-3-7091-1616-6_7"},{"key":"7119_CR22","series-title":"A canonical form guide to symbolic summation","volume-title":"Advances in the Design of Symbolic Computation Systems","author":"I. Nemes","year":"1997","unstructured":"Nemes, I. and Paule, P., A canonical form guide to symbolic summation, in Advances in the Design of Symbolic Computation Systems, Miola, A. and Temperini, M., Eds., Wien-New York: Springer, 1997, pp. 84\u2013110."},{"key":"7119_CR23","doi-asserted-by":"crossref","unstructured":"Ocansey, E.D. and Schneider, C. Representing (q-)hypergeometric products and mixed versions in difference rings, in Springer Proceedings in Mathematics and Statistics, vol 226: Advances in Computer Algebra. WWCA 2016, Schneider, C. and Zima, E., Eds., Springer, 2018, pp.\u00a0175\u2013213.","DOI":"10.1007\/978-3-319-73232-9_8"},{"key":"7119_CR24","unstructured":"Ocansey, E.D., Difference ring algorithms for nested products, PhD Thesis, RISC, J. Kepler Univ., 2019."},{"key":"7119_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1995.1049","volume":"20","author":"P. Paule","year":"1995","unstructured":"Paule, P., Greatest factorial factorization and symbolic summation, J. Symb. Comput., 1995, vol. 20, no. 3, pp.\u00a0235\u2013268.","journal-title":"J. Symb. Comput."},{"key":"7119_CR26","series-title":"A Mathematica q-analogue of Zeilberger\u2019s algorithm based on an algebraically motivated approach to q-hypergeometric telescoping","volume-title":"Special Functions, q-Series and Related Topics","author":"P. Paule","year":"1997","unstructured":"Paule, P. and Riese, A., A Mathematica q-analogue of Zeilberger\u2019s algorithm based on an algebraically motivated approach to q-hypergeometric telescoping, in Special Functions, q-Series and Related Topics, Ismail, M. and Rahman, M., Eds., AMS, 1997, vol. 14, pp.\u00a0179\u2013210."},{"key":"7119_CR27","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1006\/jsco.1995.1071","volume":"20","author":"P. Paule","year":"1995","unstructured":"Paule, P. and Schorn, M., A Mathematica version of Zeilberger\u2019s algorithm for proving binomial coefficient identities, J. Symb. Comput., 1995, vol. 20, no. 5-6, pp. 673\u2013698.","journal-title":"J. Symb. Comput."},{"key":"7119_CR28","doi-asserted-by":"crossref","unstructured":"Petkov\u0161ek, M., Wilf, H.S., and Zeilberger, D., $$A = B$$, Peters, A.K., Eds., Wellesley, MA, 1996.","DOI":"10.1201\/9781439864500"},{"key":"7119_CR29","doi-asserted-by":"crossref","unstructured":"Chen, G.F.S., Feng, R., and Li, Z., On the structure of compatible rational functions, in Proc. ISSAC 2011, San Jose, 2011, pp. 91\u201398.","DOI":"10.1145\/1993886.1993905"},{"key":"7119_CR30","doi-asserted-by":"crossref","unstructured":"Saunders, B.D. and Wan, Z., Smith normal form of dense integer matrices fast algorithms into practice, in Proc. ISSAC\u201904, Gutierrez, J., Ed., ACM Press, 2004, pp. 274\u2013281.","DOI":"10.1145\/1005285.1005325"},{"key":"7119_CR31","unstructured":"Schneider, C., Symbolic summation in difference fields, Technical Report 01-17, PhD Thesis, Linz: J. Kepler Univ., Nov. 2001."},{"key":"7119_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00026-005-0242-2","volume":"9","author":"C. Schneider","year":"2005","unstructured":"Schneider, C., Product representations in $$\\Pi \\Sigma $$-fields, Ann. Comb., 2005, vol. 9, no. 1, pp. 75\u201399.","journal-title":"Ann. Comb."},{"key":"7119_CR33","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1142\/S0219498807002302","volume":"6","author":"C. Schneider","year":"2007","unstructured":"Schneider, C., Simplifying sums in $$\\Pi \\Sigma $$-extensions, J. Algebra Appl., 2007, vol. 6, no. 3, pp. 415\u2013441.","journal-title":"J. Algebra Appl."},{"key":"7119_CR34","unstructured":"Schneider, C., Symbolic summation assists combinatorics, S\u00e9m. Lothar. Combin., 2007, vol. 56, pp. 1\u201336, Article B56b."},{"key":"7119_CR35","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.jsc.2008.01.001","volume":"43","author":"C. Schneider","year":"2008","unstructured":"Schneider, C., A refined difference field theory for symbolic summation, J. Symb. Comput., 2008, vol. 43, no. 9, pp. 611\u2013644. arXiv:0808.2543v1.","journal-title":"J. Symb. Comput."},{"key":"7119_CR36","doi-asserted-by":"crossref","unstructured":"Schneider, C., Parameterized telescoping proves algebraic independence of sums, Ann. Comb., 2010, vol. 14, pp. 533\u2013552. arXiv:0808.2596.","DOI":"10.1007\/s00026-011-0076-7"},{"key":"7119_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00200-009-0115-3","volume":"21","author":"C. Schneider","year":"2010","unstructured":"Schneider, C., Structural theorems for symbolic summation, Appl. Algebra Eng. Comm. Comput., 2010, vol. 21, no. 1, pp. 1\u201332.","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"7119_CR38","unstructured":"Schneider, C., A symbolic summation approach to find optimal nested sum representations, in Clay Mathematics Proceedings, vol. 12: Motives, Quantum Field Theory, and Pseudodifferential Operators, Carey, A., Ellwood, D., Paycha, S., and Rosenberg, S., Eds., Am. Math. Soc., 2010, pp. 285\u2013308. arXiv:0808.2543."},{"key":"7119_CR39","doi-asserted-by":"crossref","unstructured":"Schneider, C., A streamlined difference ring theory: indefinite nested sums, the alternating sign and the parameterized telescoping problem, in Proc. 15th Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Winkler, F., Negru, V., Ida, T., Jebelean, T., Petcu, D., Watt, S., and Zaharie, D., Eds., IEEE Computer Soc., 2014, pp. 26\u201333. arXiv:1412.2782v1 [cs.SC].","DOI":"10.1109\/SYNASC.2014.12"},{"key":"7119_CR40","doi-asserted-by":"crossref","unstructured":"Schneider, C., Fast algorithms for refined parameterized telescoping in difference fields, in Computer Algebra and Polynomials, Guitierrez, M.W.J. and Schicho, J., Eds., Springer, 2015, pp. 157\u2013191. arXiv:1307.7887 [cs.SC].","DOI":"10.1007\/978-3-319-15081-9_10"},{"key":"7119_CR41","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.jsc.2015.02.002","volume":"72","author":"C. Schneider","year":"2016","unstructured":"Schneider, C., A difference ring theory for symbolic summation, J. Symb. Comput., 2016, vol. 72, pp. 82\u2013127. arXiv:1408.2776 [cs.SC].","journal-title":"J. Symb. Comput."},{"key":"7119_CR42","doi-asserted-by":"crossref","unstructured":"Schneider, C., Summation theory II: characterizations of $$R\\Pi \\Sigma $$-extensions and algorithmic aspects, J. Symb. Comput., 2017, vol. 80, no. 3, pp. 616\u2013664. arXiv:1603.04285 [cs.SC].","DOI":"10.1016\/j.jsc.2016.07.028"},{"key":"7119_CR43","doi-asserted-by":"crossref","unstructured":"Singer, M., Algebraic and algorithmic aspects of linear difference equations, in Mathematical Surveys and Monographs, vol. 211: Galois Theories of Linear Difference Equations: an Introduction, Hardouin, M.S.C. and Sauloy, J., Eds., AMS, 2016.","DOI":"10.1090\/surv\/211\/01"},{"key":"7119_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0096118","volume-title":"Galois Theory of Difference Equations","author":"M. van der Put","year":"1997","unstructured":"van der Put, M. and Singer, M., Galois Theory of Difference Equations, Berlin: Springer-Verlag, 1997."},{"key":"7119_CR45","doi-asserted-by":"crossref","unstructured":"Eberly, P.G.A.S.W., Giesbrecht, M., and Villard, G., Faster inversion and other black box matrix computations using efficient block projections, in Proc. ISSAC\u201907, Brown, C., Ed., ACM Press, 2007, pp. 143\u2013150.","DOI":"10.1145\/1277548.1277569"},{"key":"7119_CR46","unstructured":"Wegschaider, K., Computer generated proofs of binomial multi-sum identities, Master\u2019s Thesis, RISC, J. Kepler Univ., May 1997."},{"key":"7119_CR47","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02100618","volume":"108","author":"H. Wilf","year":"1992","unstructured":"Wilf, H. and Zeilberger, D., An algorithmic proof theory for hypergeometric (ordinary and \u201cq\u201d) multisum\/integral identities, Invent. Math., 1992, vol. 108, pp. 575\u2013633.","journal-title":"Invent. Math."},{"key":"7119_CR48","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0377-0427(90)90042-X","volume":"32","author":"D. Zeilberger","year":"1990","unstructured":"Zeilberger, D., A holonomic systems approach to special functions identities, J. Comput. Appl. Math., 1990, vol. 32, pp. 321\u2013368.","journal-title":"J. Comput. Appl. Math."},{"key":"7119_CR49","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0747-7171(08)80044-2","volume":"11","author":"D. Zeilberger","year":"1991","unstructured":"Zeilberger, D., The method of creative telescoping, J. Symb. Comput., 1991, vol. 11, pp. 195\u2013204.","journal-title":"J. Symb. Comput."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768820020103.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768820020103","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768820020103.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:48:28Z","timestamp":1775011708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768820020103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["7119"],"URL":"https:\/\/doi.org\/10.1134\/s0361768820020103","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"18 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}