We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ only within a 2 × 2 subsquare. We prove that for all n≥2 except n∈{3, 4}, there exists a Latin square which exhibits a near-automorphism. We also show that if α has the cycle structure (2, n − 2), then L exists if and only if n≡2 (mod 4), and can be constructed from a special type of partial orthomorphism. Along the way, we generalize a theorem by Marshall Hall, which states that any Latin rectangle can be extended to a Latin square. We also show that if α has at least 2 fixed points, then L must contain two disjoint non-trivial subsquares
AbstractDenote by LS(v, n) a pair of orthogonal latin squares of side v with orthogonal subsquares o...
AbstractLet f be a permutation of V(G). Define δf(x,y)=|dG(x,y)-dG(f(x),f(y))| and δf(G)=∑δf(x,y) ov...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ o...
Abstract In this thesis we study autoparatopisms and near-autoparatopisms of Latin squares. Also we ...
Symmetries of a partial Latin square are primarily determined by its auto-topism group. Analogously ...
A Latin square is considered to be a set of n^2 cells with three block systems. An automorphism is a...
We prove several results about substructures in Latin squares. First, we explain how to adapt our re...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
This thesis primarily investigates the number Rk,n of reduced k X n Latin rectangles. Specifically, ...
An (n \times n)/k semi-Latin square is an n\times n square in which nk letters are placed so that th...
Let ζ(n, m) be the largest number of order m subsquares achieved by any Latin square of order n. We ...
AbstractLet A, B, C, D be latin squares with A orthogonal to B and C orthogonal to D. The pair A, B ...
Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime orde...
AbstractDenote by LS(v, n) a pair of orthogonal latin squares of side v with orthogonal subsquares o...
AbstractLet f be a permutation of V(G). Define δf(x,y)=|dG(x,y)-dG(f(x),f(y))| and δf(G)=∑δf(x,y) ov...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ o...
Abstract In this thesis we study autoparatopisms and near-autoparatopisms of Latin squares. Also we ...
Symmetries of a partial Latin square are primarily determined by its auto-topism group. Analogously ...
A Latin square is considered to be a set of n^2 cells with three block systems. An automorphism is a...
We prove several results about substructures in Latin squares. First, we explain how to adapt our re...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
This thesis primarily investigates the number Rk,n of reduced k X n Latin rectangles. Specifically, ...
An (n \times n)/k semi-Latin square is an n\times n square in which nk letters are placed so that th...
Let ζ(n, m) be the largest number of order m subsquares achieved by any Latin square of order n. We ...
AbstractLet A, B, C, D be latin squares with A orthogonal to B and C orthogonal to D. The pair A, B ...
Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime orde...
AbstractDenote by LS(v, n) a pair of orthogonal latin squares of side v with orthogonal subsquares o...
AbstractLet f be a permutation of V(G). Define δf(x,y)=|dG(x,y)-dG(f(x),f(y))| and δf(G)=∑δf(x,y) ov...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...