William Pettersson

William Pettersson

Headshot of William Pettersson
William Pettersson
PhD student
Department of Mathematics,
The University of Queensland,
QLD, 4072, Australia

Email: william@ewpettersson.se
XMPP: william@ewpettersson.se
Languages: English, Swedish

About Me

I am currently a Mathematics PhD student in the School of Mathematics and Physics at the University of Queensland. As a student I have played integral roles in the organisation of various social functions as a part of the Mathematics Students Society.

I was a member of the Host Scientific Committee for the 2013 International Olympiad in Informatics and am currently involved with the Queensland Informatics & Programming Club to train high school students in informatics.
Swedish flag
Section separator

Research Interests

Graph Decompositions

A decomposition of K7
  • Cycle decompositions of circulants
  • Cycle factorisations of circulants
  • Cycle decompositions of multigraphs
  • Computational approaches to finding decompositions and factorisations

Combinatorial topology

The Regina logo
Regina - Software for 3-manifold topology and normal surface theory
I am one of the developers of Regina, a suite of mathematical software for 3-manifold topologists. It focuses on the study of 3-manifold triangulations and normal surfaces. I also maintain the Gentoo packages for Regina. For official downloads for other distributions, see http://regina.source-forge.net.
Gentoo packages for Regina are available in a layman overlay. Once layman has been installed, you can install the overlay by running # layman -a regina-gentoo. You will then be able to install Regina with # emerge regina. Note that version 9999 of Regina in the overlay will always update to the latest GIT revision, which may or may not work at any given time.
Section separator


  1. D. Bryant, D. Horsley, and W. Pettersson. Decompositions of complete graphs into cycles of arbitrary lengths, Proceedings of the London Mathematical Society 2013; doi: 10.1112/plms/pdt051 http://arxiv.org/abs/1204.3709
  1. B. Burton and W. Pettersson. Fixed parameter tractable algorithms in combinatorial topology, International Computing and Combinatorics Conference, submitted February 2014. http://arxiv.org/abs/1402.3876
  2. D. Bryant, P. Danziger and W. Pettersson. Bipartite 2-factorisations of complete multipartite graphs, Journal of Graph Theory, submitted January 2013.
In preparation
  1. B. Burton and W. Pettersson. A new algorithm for enumerating triangulations of manifolds.
Section separator


At The University of Queensland
As a teaching assistant:
  • 2014 : MATH4303 Advanced Combinatorics
  • 2010-2014 : MATH3302 Coding and Cryptography
  • 2008-2009,2012-2014 : MATH1061 Discrete Mathematics
  • 2011-2013 : MATH3500 Problems and Applications in Modern Mathematics
  • 2011-2013 : MATH3301 Graph Theory and Design Theory
  • 2011 : MATH4302 Combinatorial Designs
  • 2010 : MATH3306 Set Theory and Logic
Chalk drawing of cat on blackboard
Section separator