Pith. sign in

REVIEW 1 cited by

The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.01921 v2 pith:ZZ2Q5KO7 submitted 2020-03-04 math.CO cs.SC

Carsten Schneider This is my paper
classification math.COcs.SC
keywords absent-mindedalgebracomputerpassengersproblemzeilbergerbeencalculations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In (S.B. Ekhad and D. 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Telescoping Algorithms for $\Sigma^*$-Extensions via Complete Reductions

    cs.SC 2025-06 conditional novelty 7.0 of 10

    Complete reductions can be built recursively in towers of Sigma*-extensions, yielding faster refined and parameterized telescoping algorithms for nested harmonic sums.

Pith tools