Circuits in Complete Graphs and the Dwyer Function
by ac3bf1 on May.30, 2008, under Papers & Research
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 :-)
ABSTRACT
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.
Acknowledgements
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.
2 Comments for this entry
Leave a Reply
-
Welcome to my Blog!
Thanks for dropping by! Feel free to leave comments on anything you find useful... You can stay updated by subscribing to the RSS feed, you can contact me by using the contact page, or you can Follow me on Twitter
Latest Tweets
- Report: Apple dumping Google for own Maps app in iOS 6 via @zite
http://t.co/g1ShsTXg - The Floppy Disk means Save, and 14 other old people Icons that don't make sense anymore via @zite @petarx
http://t.co/VuTsykSB - How to Build a Startup from a Beach via @zite
http://t.co/Ba8nIAQf
- Report: Apple dumping Google for own Maps app in iOS 6 via @zite
June 24th, 2011 on 7:56 pm
I’m interested in your paper with Prof. Dwyer. Unfortunately the paper mentioned above does not prove, nor does it provide citations, for two crucial results. Is there somewhere in the literature that I can look for a proof of formulae 16 and 17?
For fun I was trying to count the number of ways you can make cycles out of sets of dominoes, and the general problem is equivalent to counting eulerian cycles in complete graphs.
Thanks!
June 28th, 2011 on 8:23 am
Hey Cam, first of all, thanks for the comment, second, I have forwarded this message to Prof Dwyer who might reply. If he does I’ll email you with what he says :-)
Jonathan