{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:25:15Z","timestamp":1649071515307},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Johannes Kepler University Linz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In Ekhad and Zeilberger (Personal J Shalosh B Ekhad and Doron Zeilberger, 2020) an exciting case study has been initiated in which experimental mathematics and symbolic computation are utilized to discover new properties concerning the so-called Absent-Minded Passengers Problem. Based on these results, Doron Zeilberger raised some challenging tasks to gain further probabilistic insight. In this note we report on this enterprise. In particular, we demonstrate how the computer algebra packages of RISC can be used to carry out the underlying heavy calculations.\n<\/jats:p>","DOI":"10.1007\/s11786-020-00494-w","type":"journal-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T21:17:40Z","timestamp":1597007860000},"page":"577-588","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra"],"prefix":"10.1007","volume":"15","author":[{"given":"Carsten","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"494_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cpc.2016.01.002","volume":"202","author":"J Ablinger","year":"2016","unstructured":"Ablinger, J., Behring, A., Bl\u00fcmlein, J., De Freitas, A., von Manteuffel, A., Schneider, C.: Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra. Comput. Phys. Commun. 202, 33\u2013112 (2016). arXiv:1509.08324 [hep-ph]","journal-title":"Comput. Phys. Commun."},{"issue":"10","key":"494_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1063\/1.3629472","volume":"52","author":"J Ablinger","year":"2011","unstructured":"Ablinger, J., Bl\u00fcmlein, J., Schneider, C.: Harmonic sums and polylogarithms generated by cyclotomic polynomials. J. Math. Phys. 52(10), 1\u201352 (2011). [arXiv:1007.0375 [hep-ph]]","journal-title":"J. Math. Phys."},{"issue":"8","key":"494_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1063\/1.4811117","volume":"54","author":"J Ablinger","year":"2013","unstructured":"Ablinger, J., Bl\u00fcmlein, J., Schneider, C.: Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms. J. Math. Phys. 54(8), 1\u201374 (2013). arXiv:1302.0378 [math-ph]","journal-title":"J. Math. Phys."},{"issue":"2","key":"494_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00026-018-0381-5","volume":"22","author":"J Ablinger","year":"2018","unstructured":"Ablinger, J., Schneider, C.: Algebraic independence of sequences generated by (cyclotomic) harmonic sums. Ann. Combin. 22(2), 213\u2013244 (2018). arXiv:1510.03692 [cs.SC]","journal-title":"Ann. Combin."},{"key":"494_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511816574","volume-title":"The Art of Mathematics: Coffee Time in Memphis","author":"B Bollob\u00e1s","year":"2006","unstructured":"Bollob\u00e1s, B.: The Art of Mathematics: Coffee Time in Memphis. Cambridge University Press, Cambridge (2006)"},{"key":"494_CR6","unstructured":"Ekhad, S.B., Zeilberger, D.: The absent-minded passengers problem via computer algebra. The Personal Journal of Shalosh B. Ekhad and Doron Zeilberger, (2020) arXiv:2001.06839 [math.CO]"},{"issue":"10","key":"494_CR7","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1080\/00029890.2019.1656024","volume":"126","author":"N Henze","year":"2019","unstructured":"Henze, N., Last, G.: Absent-minded passengers. Am. Math. Monthly 126(10), 867\u2013875 (2019). arXiv:1809.10192 [math.PR]","journal-title":"Am. Math. Monthly"},{"key":"494_CR8","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 28, 305\u2013350 (1981)","journal-title":"J. ACM"},{"key":"494_CR9","volume-title":"$$A=B$$","author":"M Petkov\u0161ek","year":"1996","unstructured":"Petkov\u0161ek, M., Wilf, H.S., Zeilberger, D.: $$A=B$$. A K Peters, Wellesley (1996)"},{"key":"494_CR10","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.ejc.2011.04.002","volume":"32","author":"H Prodinger","year":"2011","unstructured":"Prodinger, H., Schneider, C., Wagner, S.: Unfair permutations. Europ. J. Comb. 32, 1282\u20131298 (2011)","journal-title":"Europ. J. Comb."},{"key":"494_CR11","unstructured":"Schneider, C.: Symbolic summation assists combinatorics. S\u00e9m.\u00a0Lothar. Combin., 56:1\u201336, (2007) Article B56b"},{"key":"494_CR12","doi-asserted-by":"crossref","unstructured":"Schneider, C.: Parameterized telescoping proves algebraic independence of sums. Ann. Comb., 14:533\u2013552, (2010). [arXiv:0808.2596]; for a preliminary version see FPSAC 2007","DOI":"10.1007\/s00026-011-0076-7"},{"key":"494_CR13","doi-asserted-by":"crossref","unstructured":"Schneider, C.: Simplifying multiple sums in difference fields. In C.\u00a0Schneider and J.\u00a0Bl\u00fcmlein, editors, Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, Texts and Monographs in Symbolic Computation, pp. 325\u2013360. Springer, (2013). arXiv:1304.4134 [cs.SC]","DOI":"10.1007\/978-3-7091-1616-6_14"},{"key":"494_CR14","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. 72, 82\u2013127 (2016). arXiv:1408.2776 [cs.SC]","journal-title":"J. Symb. Comput."},{"issue":"3","key":"494_CR15","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.jsc.2016.07.028","volume":"80","author":"C Schneider","year":"2017","unstructured":"Schneider, C.: Summation Theory II: Characterizations of $$R\\Pi \\Sigma $$-extensions and algorithmic aspects. J. Symb. Comput 80(3), 616\u2013664 (2017). arXiv:1603.04285 [cs.SC]","journal-title":"J. Symb. Comput"},{"key":"494_CR16","doi-asserted-by":"crossref","unstructured":"Winkler, P.: Mathematical Puzzles: A Connoisseur\u2019s Collection. A K Peters, (2004)","DOI":"10.1201\/b16493"},{"key":"494_CR17","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. Symbolic Comput. 11, 195\u2013204 (1991)","journal-title":"J. Symbolic Comput."},{"key":"494_CR18","doi-asserted-by":"crossref","unstructured":"Zeilberger, D.: The automatic central limit theorems generator (and much more!). In Advances in combinatorial mathematics, pp. 165\u2013174. Springer, Berlin, (2009)","DOI":"10.1007\/978-3-642-03562-3_8"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00494-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-020-00494-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00494-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T04:12:47Z","timestamp":1633752767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-020-00494-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,9]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["494"],"URL":"https:\/\/doi.org\/10.1007\/s11786-020-00494-w","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,9]]},"assertion":[{"value":"7 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}