M.S. Defense: Connor Weyers
Wednesday, April 30
11 AM
211 Schorr Center
Zoomhttps://unl.zoom.us/j/93872816050
"Algorithms for Order Statistics in Farey Sequences: A Computational Study"
Farey sequences are the sets of irreducible fractions in increasing order with denominator less than some integer n. They are a well-known concept in number theory problems and are related to many other concepts in number theory including integer factoring, Fibonacci sequences, and Riemann’s Zeta function. In this paper, we investigate some known algorithms to solve certain problems in Farey sequences from a computational perspective. In particular, we implement established algorithms that have not been previously implemented with the goal to create a package that can be used more broadly. We also develop a new algorithm for rational search which generalizes known algorithms for the problem
Committee:
Dr. Vinodchandran Variyam, Chair
Dr. Jitender Deogun
Dr. Lisong Xu