Projects per year

## Personal profile

### Biography

**The puzzling mathematician **

They say Sudoku puzzles require no mathematics to solve. Australian Mathematical Society 2009 medal winner Dr Ian Wanless disagrees. He views Sudoku as an example of a branch of mathematics called combinatorics. Its outstanding feature is Sunday-afternoon surface simplicity. But mathematical solutions to these puzzles hold surprising conceptual depth and applications in information and communication technology (ICT).

Dr Wanless has always loved solving puzzles and the field of combinatorics mathematics allows him to do just that. The problems he solves resemble those found in puzzle books, including anagrams and crosswords. They tend to involve permutations, combinations and rearrangement of symbols.

Much of the motivation for studying combinatorics comes from ICT and includes applications such as coding mobile phone signals or writing music on a CD. Ultimately, this is where a lot of his work finds application. Personally, he is not interested in applying his solutions.

'I like the problems for their elegance as an intellectual puzzle,' Ian says. The problems he finds most attractive are those that can be stated so simply that a child can understand them. Yet some deep mathematics are needed to arrive at a solution that works for every permutation.

The classic combinatorics example is the four-colour map problem. The problem seems simple. It asks how many colours are needed to colour regions on a map so that no two adjacent regions have the same colour. It was posed in the 19th century but took more than 100 years to solve.

'As mathematicians we are trying to find universal, absolute solutions, with the added bonus that nobody has done it before. You need an inescapable reason why whatever example of a puzzle you tried, the solution you propose would always work.

'A mathematical argument has to be general and cover every contingency,' he says. 'That is the idea of proof and it is very important. Certain things that appear to be obvious can be extremely difficult to prove.'

His current favourite questions deal with Latin squares. A finished Sudoku puzzle is an example of a Latin square. These are problems in which symbols fit in a matrix and each symbol occurs once in each row and column.

'Latin squares arise in the design of statistical experiments in agriculture and psychology,' Ian says. 'They are used to decide in which order to do experiments and they are useful in designing code for communication. I'm interested in basic properties like how many there are. Again, they are problems you can explain to a child yet some tricky math is needed to solve them.'

Contrary to stereotypes of the lone wolf intellectual, Ian enjoys collaborating. He has a dozen projects in the works, many involving colleagues in the US, Europe and Asia.

'I'm very much of the opinion that mathematics is a team sport,' he says. 'I do write papers on my own. But it is more fun to collaborate. A lot of the best projects come from cross-fertilisation from different branches, as is the case in all science. You get surprising results when working between fields rather than in a field.'

### Keywords

- Latin Squares
- Combinatorial Designs
- Combinatorial Enumeration
- Matrix Permanents
- Graph Theory

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Projects 2006 2020

## Matchings in Combinatorial Structures

Wanless, I. M., Bryant, D. & Horsley, D.

Australian Research Council (ARC), Monash University, The University of Queensland , The University of Melbourne

1/01/15 → 10/10/20

Project: Research

## Towards the prime power conjecture

Australian Research Council (ARC), Monash University

27/02/12 → 31/12/16

Project: Research

## Extremal Problems in Hypergraph Matchings

Wanless, I. M., Greenhill, C. & Aharoni, R.

Australian Research Council (ARC), The University of New South Wales

3/01/12 → 31/12/14

Project: Research

## Permanents, permutations and polynomials

Wanless, I. M. & McKay, B.

Australian Research Council (ARC), Monash University, Australian National University

4/01/10 → 31/12/13

Project: Research

## Research Output 2001 2018

## Parity of sets of mutually orthogonal Latin squares

Francetić, N., Herke, S. & Wanless, I. M. 1 Apr 2018 In : Journal of Combinatorial Theory. Series A. 155, p. 67-99 33 p.Research output: Contribution to journal › Article › Research › peer-review

## Small partial Latin squares that embed in an infinite group but not into any finite group

Dietrich, H. & Wanless, I. M. 2018 In : Journal of Symbolic Computation. 86, p. 142-152 11 p.Research output: Contribution to journal › Article › Research › peer-review

## Transversals in Latin Arrays with Many Distinct Symbols

Best, D., Hendrey, K., Wanless, I. M., Wilson, T. E. & Wood, D. R. 2018 In : Journal of Combinatorial Designs. 26, 2, p. 84-96 13 p.Research output: Contribution to journal › Article › Research › peer-review

## Autoparatopisms of Quasigroups and Latin Squares

Mendis, M. J. L. & Wanless, I. 1 Feb 2017 In : Journal of Combinatorial Designs. 25, 2, p. 51-74 24 p.Research output: Contribution to journal › Article › Research › peer-review

## Existence results for cyclotomic orthomorphisms

Fear, D. & Wanless, I. 26 Jan 2017 (Accepted/In press) In : Journal of Algebraic Combinatorics. 14 p.Research output: Contribution to journal › Article › Research › peer-review