Tree Automaton
Dillon Mayhew's website


I work at the School of Computing at the University of Leeds. I am a member of the Algorithms and Complexity group. Prior to this position I was at Te Kura Mātai Tatauranga (School of Mathematics and Statistics) at Te Herenga Waka (Victoria University of Wellington) in New Zealand.

My research touches on various themes: the theory of computation, its connections to formal languages, and the power of those languages to make statements about discrete structures such as graphs and matroids.

Matroids are abstractions of finite geometrical configurations. You can find an introduction to matroid theory in the survey paper by James Oxley entitled What is a matroid? For a more technical discussion, take a look at the Matroid Union blog.

I have given talks for the Matroid Union series of virtual seminars organised by the Combinatorics and Optimisation department of University of Waterloo: one on monadic definability of classes of matroids, and another on matroids that are transversal and cotransversal.

For several years I visited the programme Nights on Radio New Zealand to talk about mathematics. Here are our conversations.

If you think you may be interested in postgraduate work in my area of research, then please contact me.