We give and prove group-theoretic lemmas which would enable one to find the non-isomorphism classes of the (n × n) / k semi-Latin squares. These lemmas are most useful when the sizes and number of semi-Latin squares under consideration are large, and the computing method via the ‘nauty package' for finding their isomorphism classes, given by Bailey and Chigbu, is not readily available. Global Journal of Pure and Applied Sciences Volume , No 1 January (2001) pp. 189-198 KEY WORDS: Concurrence parameters, enumeration, semi-Latin square, non-isomorphism, Trojan square
AbstractThe numbers of non-isomorphic Latin squares of order 8 under the action of various different...
We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ o...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
An (n \times n)/k semi-Latin square is an n\times n square in which nk letters are placed so that th...
AbstractAn (n × n)/k semi-Latin square is an n × n square in which nk letters are placed so that the...
A method is described of enumerating totally symmetric Latin squares in their isomorphism classes. T...
Let n be an integer. We show the existence of at least three non-isomorphic non-commutative Latin sq...
Abstract. Constructive and nonconstructive techniques are employed to enu-merate Latin squares and r...
AbstractLet A, B, C, D be latin squares with A orthogonal to B and C orthogonal to D. The pair A, B ...
Not AvailableA new method of construction of (n x n)/k semi-Latin square based on initial column sol...
Ejemplar dedicado a: Special issue on Non-commutative Gröbner Bases and ApplicationsLatin squares ca...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
AbstractLatin squares can be seen as multiplication tables of quasigroups, which are, in general, no...
AbstractIn this paper equivalence classes of Latin squares induced by row and column permutations ar...
A multi-latin square of order n and index k is an n×n array of multisets, each of cardinality k, suc...
AbstractThe numbers of non-isomorphic Latin squares of order 8 under the action of various different...
We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ o...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...
An (n \times n)/k semi-Latin square is an n\times n square in which nk letters are placed so that th...
AbstractAn (n × n)/k semi-Latin square is an n × n square in which nk letters are placed so that the...
A method is described of enumerating totally symmetric Latin squares in their isomorphism classes. T...
Let n be an integer. We show the existence of at least three non-isomorphic non-commutative Latin sq...
Abstract. Constructive and nonconstructive techniques are employed to enu-merate Latin squares and r...
AbstractLet A, B, C, D be latin squares with A orthogonal to B and C orthogonal to D. The pair A, B ...
Not AvailableA new method of construction of (n x n)/k semi-Latin square based on initial column sol...
Ejemplar dedicado a: Special issue on Non-commutative Gröbner Bases and ApplicationsLatin squares ca...
AbstractA latin square of order ten is displayed having an orthogonal mate, but no nontrivial automo...
AbstractLatin squares can be seen as multiplication tables of quasigroups, which are, in general, no...
AbstractIn this paper equivalence classes of Latin squares induced by row and column permutations ar...
A multi-latin square of order n and index k is an n×n array of multisets, each of cardinality k, suc...
AbstractThe numbers of non-isomorphic Latin squares of order 8 under the action of various different...
We define a near-automorphism α of a Latin square L to be an isomorphism such that L and αL differ o...
Let n be a positive integer. A Latin square of order n is an n×n array L such that each element of s...