Project Details
Project Description
The prime power conjecture is the most prominent open problem in combinatorial design theory. Its solution would have far-reaching consequences in areas as diverse as coding theory, statistical experiment design and finite geometry. This project will develop the theoretical tools needed to attack the conjecture and other closely related problems. The patterns it uncovers will reveal new codes for communication and new, more efficient designs for statistical experiments. The project may also prove in some cases that there are no better codes or designs than what we currently use. In the process it will dramatically increase our knowledge base in combinatorics, which is a branch of mathematics of crucial importance in the computer age.
| Status | Finished |
|---|---|
| Effective start/end date | 27/02/12 → 31/12/16 |
Funding
- ARC - Australian Research Council: A$54,142.00
- ARC - Australian Research Council: A$622,856.00
- Monash University
-
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
10 Link opens in a new tab Citations (Scopus) -
Enumeration of MOLS of small order
Egan, J. & Wanless, I. M., 2016, In: Mathematics of Computation. 85, 298, p. 799-824 26 p.Research output: Contribution to journal › Article › Research › peer-review
44 Link opens in a new tab Citations (Scopus) -
Permanents and determinants of Latin squares
Donovan, D., Johnson, K. & Wanless, I. M., 1 Mar 2016, In: Journal of Combinatorial Designs. 24, 3, p. 132-148 17 p.Research output: Contribution to journal › Article › Research › peer-review
4 Link opens in a new tab Citations (Scopus)