Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Ian M. Wanless is active.

Publication


Featured researches published by Ian M. Wanless.


European Journal of Combinatorics | 2004

Diagonally cyclic latin squares

Ian M. Wanless

A latin square of order n possessing a cyclic automorphism of order n is said to be diagonally cyclic because its entries occur in cyclic order down each broken diagonal. More generally, we consider squares possessing any cyclic automorphism. Such squares will be named after Parker, in recognition of his seminal contribution to the study of orthogonal latin squares. Our primary aim is to survey the multitude of applications of Parker squares and to collect the basic results on them together in a single location. We mention connections with orthomorphisms and near-orthomorphisms of the cyclic group as well as with starters, even starters, atomic squares, Knut Vik designs, bachelor squares and pairing squares.In addition to presenting the basic theory we prove a number of original results. The deepest of these concern sets of mutually orthogonal Parker squares and their interpretation in terms of orthogonal arrays. In particular we study the effect of the various transformations of these orthogonal arrays which were introduced by Owens and Preece.Finally, we exhibit a new application for diagonally cyclic squares; namely, the production of subsquare free squares (so called N∞ squares). An explicit construction is given for a latin square of any odd order. The square is conjectured to be N∞ and this has been confirmed up to order 10 000 by computer. This represents the first published construction of an N∞ square for orders 729, 2187 and 6561.


SIAM Journal on Discrete Mathematics | 2008

A Census of Small Latin Hypercubes

Brendan D. McKay; Ian M. Wanless

We count all latin cubes of order


Designs, Codes and Cryptography | 2006

The Existence of Latin Squares without Orthogonal Mates

Ian M. Wanless; Bridget S. Webb

n\le6


Graphs and Combinatorics | 2004

Cycle Switches in Latin Squares

Ian M. Wanless

and latin hypercubes of order


Journal of Combinatorial Theory | 1999

Most Latin Squares Have Many Subsquares

Brendan D. McKay; Ian M. Wanless

n\le5


Journal of Combinatorial Theory | 2002

A Family of Perfect Factorisations of Complete Bipartite Graphs

Darryn E. Bryant; Barbara M. Maenhaut; Ian M. Wanless

and dimension


Mathematics of Computation | 2016

Enumeration of MOLS of small order

Judith Egan; Ian M. Wanless

d\le5


Nagoya Mathematical Journal | 2012

How not to prove the Alon-Tarsi conjecture

Douglas S. Stones; Ian M. Wanless

. We classify these (hyper)cubes into isotopy classes and paratopy classes (main classes). For the same values of


Discrete Mathematics | 2009

The spectrum for quasigroups with cyclic automorphisms and additional symmetries

Darryn E. Bryant; Melinda Buchanan; Ian M. Wanless

n


Journal of Combinatorial Theory | 2001

Regular Graphs with No Homomorphisms onto Cycles

Ian M. Wanless; Nicholas C. Wormald

and

Collaboration


Dive into the Ian M. Wanless's collaboration.

Top Co-Authors

Avatar

Brendan D. McKay

Australian National University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Nicholas J. Cavenagh

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Nicholas J. Cavenagh

University of New South Wales

View shared research outputs
Researchain Logo
Decentralizing Knowledge