David Bevan

David Bevan

Visiting Research Fellow

I have recently been appointed as a Lecturer in Combinatorics in the Combinatorics Group of the Department of Computer & Information Sciences at the University of Strathclyde.

My University of Strathclyde web page is here.

My new email address is david.bevan@strath.ac.uk.


In the 1980s, following undergraduate studies in mathematics at the University of Oxford, I undertook some computer science research. For my Oxford M.Sc. dissertation, I developed a model for the denotational semantics of the concurrent programming language occam. Following this, I spent two years in industry with GEC, working on formalisms for specifying communications protocols, and, as part of a project to design a parallel machine to run functional programming languages, produced a paper that introduced weighted reference counting, now a key method for managing memory in distributed computer architectures.

This was followed by a career in software development, first as a developer, consultant and trainer for the Summer Institute of Linguistics, based in Papua New Guinea, and subsequently as a software engineer and development manager with Emtex Ltd. (acquired by Pitney Bowes in 2006).

A decade ago, I carried out some independent mathematical research in my spare time, resulting in the publication of a paper improving on a long-standing extremal result of Erdős and Füredi in discrete geometry.

In 2012, I left software development for full-time mathematical research, and in June 2015 was awarded a PhD in enumerative combinatorics from The Open University. My supervisor was Robert Brignall. The topic of my thesis is the growth of permutation classes. As a result of my doctoral studies, I produced five papers. One of these provides the first general result concerning the exact growth rates of a broad family of permutation classes and has been published in the Transactions of the American Mathematical Society. Another, published in the Journal of the London Mathematical Society, uses a novel approach to yield an improved lower bound to the notorious problem of computing the growth rate of the class of permutations avoiding the pattern 1324.

Since completing my PhD, I have produced four more papers. Two of these concern the degree-diameter problem for Cayley graphs. The other two address specific enumerative questions in pattern-avoidance. I am currently a Visiting Research Fellow in the Department of Mathematics and Statistics at The Open University, and an Associate Lecturer in theoretical computer science.


My curriculum vitae.
 

My research interests concern aspects of enumerative, asymptotic and extremal combinatorics, particularly with relation to permutations.

Preprints

Recent publications

Details of all my publications can be found on my Google Scholar page.

Slides from talks

Mathematica demonstrations

I am an associate lecturer ("tutor") for the second year computer science module M269, Algorithms, data structures and computability. Some resources for this module can be found in the Dropbox folder linked from here, including a simple implementation of a Universal Turing machine for running on Anthony Morphett’s Turing machine simulator at http://morphett.info/turing/turing.html. This link automatically loads the code for the UTM into the simulator.

I was also responsible for using STACK and Maxima to create some iCMAs (interactive computer marked assignments) for the introductory mathematics module MST124, Essential mathematics 1.


Associated with:

Pure Mathematics


Email:
[javascript protected email address]

Research Themes