AbstractA sequencing in a finite group G is a list of all elements of G such that the partial products of the list are all distinct. The existence of a sequencing in the nonabelian group of order pn which contains an element of order pn−1, where p is an odd prime and n>2, is demonstrated. It follows that complete latin squares exist for these orders. A sufficient condition for the existence of a sequencing in the nonabelian group of order pq is also given, where p<q are odd primes with q=2h+1 for some integer h
AbstractAn n × n square L on n symbols is called row (column) complete if every ordered pair of the ...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
AbstractA sequencing in a finite group G is a list of all elements of G such that the partial produc...
AbstractLet p be an odd prime which has 2 as a primitive root and let q be another odd prime of the ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractAn n × n square L on n symbols is called row (column) complete if every ordered pair of the ...
AbstractIt is shown that if a finite group G of odd order has what is called a starter-translate 2-s...
AbstractA finite group (G, ·) is said to be sequenceable if its elements can be arranged in a sequen...
AbstractIt is shown that if a finite group G of odd order has what is called a starter-translate 2-s...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractAt least three-fourths of the dihedral groups Dn are sequenceable: all but D3 and D4 (which ...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
AbstractLatin squares can be classified as odd or even according to the signs of the permutations gi...
AbstractWe construct Latin squares of order n = pq which have no proper subsquares when p and q are ...
AbstractAn n × n square L on n symbols is called row (column) complete if every ordered pair of the ...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
AbstractA sequencing in a finite group G is a list of all elements of G such that the partial produc...
AbstractLet p be an odd prime which has 2 as a primitive root and let q be another odd prime of the ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractAn n × n square L on n symbols is called row (column) complete if every ordered pair of the ...
AbstractIt is shown that if a finite group G of odd order has what is called a starter-translate 2-s...
AbstractA finite group (G, ·) is said to be sequenceable if its elements can be arranged in a sequen...
AbstractIt is shown that if a finite group G of odd order has what is called a starter-translate 2-s...
AbstractWe investigate the construction of sets of t latin squares of a given non-prime-power order ...
AbstractAt least three-fourths of the dihedral groups Dn are sequenceable: all but D3 and D4 (which ...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
AbstractLatin squares can be classified as odd or even according to the signs of the permutations gi...
AbstractWe construct Latin squares of order n = pq which have no proper subsquares when p and q are ...
AbstractAn n × n square L on n symbols is called row (column) complete if every ordered pair of the ...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a p...