During the Fall 2021, Spring 2022 school year, I worked on a research team studing the mathematical concept of k-distinct lattice paths. Our research involved finding maximum cardinality sets of lattice paths on a paricular size lattice such that no path overlapped with another on k or more edges. We will be publishing the results of our research in the near future.

I led the programming effort on this project to develop code to test a greedy algorithm and a brute force algorithm for generating maximum sets of lattice paths. This was the first project I worked on for which I made extensive use of Go. I initially wrote most of the codebase in Python, but it was not fast enough for extended work on brute-force computation.

Source Code

The source code for this project is available on GitHub.

Results

Our undergraduate research symposium presentation is available here. The presentation contains a basic summary of our results. We are currently working on publishing a full-length article in an undergraduate research journal.