Ian M. Wanless

most citedLatin squares without proper subsquares

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2024

Latin Squares whose transversals share many entries

Afsane Ghafari, Ian M. Wanless

We prove that, for all even $n \geq 10$ , there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $⌊ n /6 ⌋$ entri…

math.CO2024

Commuting Pairs in Quasigroups

Jack Allsop, Ian M. Wanless

A quasigroup is a pair $(Q, *)$ where $Q$ is a non-empty set and $*$ is a binary operation on $Q$ such that for every $(a, b) \in Q^{2}$ there exists a unique $(x, y) \in Q^{2}$ such t…

math.CO2024

Excess Coverage Arrays and Levenshtein's Conjecture

Amber E. Gentle, Daniel Horsley, Ian M. Wanless

A sequence covering array, denoted \textsf{SCA} $(N; t, v)$ , is a set of $N$ permutations of ${0, \dots, v - 1}$ such that each sequence of $t$ distinct elements of $\{0, \dots, v-1\…

math.CO2024★ 1 cited

Canonical labelling of Latin squares in average-case polynomial time

Michael J. Gill, Adam Mammoliti, Ian M. Wanless

A Latin square of order $n$ is an $n \times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $ε > 0$ , we show that with high probability a uniform…

math.CO2023★ 2 cited

Latin squares without proper subsquares

Jack Allsop, Ian M. Wanless

A $d$ -dimensional Latin hypercube of order $n$ is a $d$ -dimensional array containing symbols from a set of cardinality $n$ with the property that every axis-parallel line contains…