Jonathan Arbib

Circuits in Complete Graphs and the Dwyer Function

by on May.30, 2008, under Papers & Research


Published on

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.

:, , , , ,

2 Comments for this entry

  • Cam

    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.


  • ac3bf1

    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 :-)


Leave a Reply

You must be logged in to post a comment.

Looking for something?

Use the form below to search the site:

Still not finding what you're looking for? Drop a comment on a post or contact us so we can take care of it!