Now showing items 1-3 of 3

  • Constructing (0,1)-matrices with large minimal defining sets

    Cavenagh, Nicholas J.; Ramadurai, Reshma (Elsevier, 2018)
    If D is a partially filled-in (0, 1)-matrix with a unique completion to a (0, 1)-matrix M (with prescribed row and column sums), we say that D is a defining set for M. Let A₂ₘ,ₘbe the set of (0, 1)-matrices of dimensions ...
  • On the distances between Latin squares and the smallest defining set size

    Cavenagh, Nicholas J.; Ramadurai, Reshma (Elsevier, 2016)
    We show that for each Latin square L of order n ≥ 2 , there exists a Latin square L’ ≠ L of order n such that L and L’ differ in at most 8√n̅ cells. Equivalently, each Latin square of order n contains a Latin trade of ...
  • On the Distances between Latin Squares and the Smallest Defining Set Size

    Cavenagh, Nicholas J.; Ramadurai, Reshma (Wiley, 2017)
    In this note, we show that for each Latin square L of order n≥2 , there exists a Latin square L’≠L of order n such that L and L’ differ in at most 8√n cells. Equivalently, each Latin square of order n contains a Latin ...

Reshma Ramadurai has 1 co-authors in Research Commons.