Several Topics in Experimental Mathematics
Andrew Lohr

TL;DR
This thesis applies experimental mathematics to diverse problems including random trees, lattice paths, summation algorithms, and a graph conjecture, providing new computational methods and partial proofs.
Contribution
It introduces automated procedures for moments of random trees, finds recurrences for lattice path counts, extends summation algorithms, and proves a case of the bunk bed conjecture.
Findings
Automated computation of moments for Galton-Watson trees.
Recurrences for lattice paths with rational slopes.
Partial proof of the bunk bed conjecture for specific cases.
Abstract
This thesis deals with applications of experimental mathematics to a number of problems. The first problem is related to random graph statistics. We consider a certain class of Galton-Watson random trees and look at the total height statistic. We provide an automated procedure for computing values of the moments of this statistic. Next, we investigate several problems related to lattice paths staying below a line of rational slope. These results are largely data-based. Using the generated data, we are able to find recurrences for the number of such paths for the cases of slopes 3/2 and 5/2. There is also investigation of a generalization of these problems to three dimensions. We also examine generalizations of Sister Celine's method and Gosper's algorithm for evaluating summations. For both, we greatly extend the classes of applicable functions and applications to proving, or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms
