CIRCUITS IN COMPLETE GRAPHS AND THEIR RELATIONS TO RAPIDLY-INCREASING SPECIAL FUNCTIONS
Published on http://www.algana.co.uk/Research/research.html
Download Paper – circuits-in-complete-graphs
News item on Richmond Website
This is from work I did last year with class mates. It proved to be really interesting, and possibly the most interesting mathematical topic I ever encountered 🙂
Author: Professor John Dwyer
In computing, several rapidly-increasing functions are used in areas such as computability, algorithm analysis and tractability. These include Ackerman’s function, Dwyer’s function and Euler’s Gamma function. This paper investigates these functions and compares them asymptotically.
Several colleagues and project students contributed to the results detailed in this paper, including Professor Wathek Talebaoui, Danladi Abdulaziz, Karwan Al-Sourchi, Jonathan Arbib, Denka Bancheva, Jordan Berkowitz, Emma Dwyer, Daniel Frincu, Salisu Gambo, Saniul Hossain, Ike Igboanugo, Elyse Loosararian, Alin Petculescu, Vjose Retkoceri, Ademola Shasanya and Long Tran.