|
Organizers |
The size of the smallest latin interchange in a back circulant latin square.
by
Nicholas J Cavenagh
University of Queensland
Given two distinct latin squares L1 and L2 of order n, the set of elements of L1 which differ from those in L2 is a latin interchange. We show that the size of the smallest latin interchange in the back circulant square of order n is no less than elogp +2, where p is the smallest prime that divides n. We also show that if n is a term in the Fibonacci sequence, there is a latin interchange of size O(logn) in the back circulant latin square of order n.
Date received: November 2, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-25.