4 citations · 4 across the 4 of their papers we have counts for
9 papers
Multidimensional permanents of polystochastic matrices
Billy Child, Ian M. Wanless
A -dimensional matrix is called \emph{-polystochastic} if it is non-negative and the sum over each line equals~. Such a matrix that has a single in each line and zeros…
Parity of transversals of Latin squares
Darcy Best, Ian M. Wanless
We introduce a notion of parity for transversals, and use it to show that in Latin squares of order , the number of transversals is a multiple of 4. We also demonstrate…
Most binary matrices have no small defining set
Carly Bodkin, Anita Liebenau, Ian M. Wanless
Consider a matrix chosen uniformly at random from a class of matrices of zeros and ones with prescribed row and column sums. A partially filled matrix is a $\m…
Perfect 1-factorisations of
Michael J. Gill, Ian M. Wanless
We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisations (P1Fs) of the complete graph . Of these, 89 have a non-trivial autom…
Covering radius in the Hamming permutation space
Kevin Hendrey, Ian M. Wanless
Let denote the set of permutations of . The function is defined to be the minimum size of a subset with the pro…
What did Ryser Conjecture?
Darcy Best, Ian M. Wanless
Two prominent conjectures by Herbert J. Ryser have been falsely attributed to a somewhat obscure conference proceedings that he wrote in German. Here we provide a translation of th…