An Experimental Mathematics Approach to the Area Statistic of Parking Functions
Yukun Yao, Doron Zeilberger

TL;DR
This paper demonstrates an empirical approach to mathematical research using parking functions and their area statistic, emphasizing the rigor and effectiveness of finitistic, elementary methods supported by computational tools.
Contribution
It introduces a purely finitistic, elementary experimental methodology for studying parking functions, showcasing its rigor and utility in combinatorial mathematics.
Findings
Validated empirical methods for analyzing parking functions
Demonstrated the effectiveness of computational tools in combinatorics
Provided new insights into the area statistic of parking functions
Abstract
We illustrate the experimental, empirical, approach to mathematics (that contrary to popular belief, is often rigorous), by using parking functions and their "area" statistic, as a case study. Our methods are purely finitistic and elementary, taking full advantage, of course, of our beloved silicon servants.
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
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Advanced Graph Theory Research
