10 citations · 31 across the 22 of their papers we have counts for
25 papers
Defining sets which intersect each Latin trade at least twice
Richard Bean, Nicholas Cavenagh
A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a -strong defining…
Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs
Carly Bodkin, Nicholas J. Cavenagh, Ian M. Wanless
A binary frequency square of type is a -matrix of order with zeros and ones in each row and in each column. Two such squares are orthogonal if…
Weak colourings of Kirkman triple systems
Andrea C. Burgess, Nicholas J. Cavenagh, Peter Danziger +1
A -colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} of a block design is the smallest in…
Latin bitrades derived from quasigroup autoparatopisms
Nicholas Cavenagh, Raúl Falcón
In 2008, Cavenagh and Drápal, et al, described a method of constructing Latin trades using groups. The Latin trades that arise from this construction are entry-transitive (that is,…
Mutually orthogonal frequency rectangles
Fahim Rahim, Nicholas J. Cavenagh
A frequency rectangle of type FR is an matrix such that each symbol from a set of size appears times in each row and times in each column. Two…
Row-column factorial designs with strength at least
Fahim Rahim, Nicholas J. Cavenagh
The (full) factorial design with replication is the multi-set consisting of occurrences of each element of each -ary vector of length ; we denote this by $λ\tim…