The absent-minded passengers problem: a motivating challenge solved by computer algebra

DOI10.1007/S11786-020-00494-WOpenAlexW3048141987MaRDI QIDQ2071521FDOQ2071521

Yanyan Li

Publication date: 28 January 2022

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.01921

zbMATH Keywords

asymptotic expansioncombinatoricsprobabilitygenerating function approachsymbolic summation

Mathematics Subject Classification ID

Combinatorial probability (60C05) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic summation assists combinatorics
• Simplifying Multiple Sums in Difference Fields
• The Automatic Central Limit Theorems Generator (and Much More!)
• Harmonic sums and polylogarithms generated by cyclotomic polynomials
• Calculating three loop ladder and \(V\)-topologies for massive operator matrix elements by computer algebra
• Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms
• The method of creative telescoping
• Summation in Finite Terms
• Parameterized telescoping proves algebraic independence of sums
• A difference ring theory for symbolic summation
• Unfair permutations
• Absent-Minded Passengers
• Algebraic independence of sequences generated by (cyclotomic) harmonic sums
• Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects

Cited In (2)

• The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra
• Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

Uses Software

• SIGMA
• CLT
• EvaluateMultiSums
• BiVariateMoms

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The assignment problem revisited 👍 👎
• A Matheuristic for the Dial-a-Ride Problem 👍 👎
• In Pursuit of the Traveling Salesman 👍 👎
• In Pursuit of the Traveling Salesman 👍 👎
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem 👍 👎
• The Blind Passenger and the Assignment Problem 👍 👎

This page was built for publication: The absent-minded passengers problem: a motivating challenge solved by computer algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071521)