#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1981

2002

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Charles Laywine
- J. Comb. Theory, Ser. A
- 1981

A Latin square of order n is an n x n array of cells, such that each row and column contains a permutation of the first n integers. We will use Burnside’s lemma [2, Theorem 5-21 to count the number of equivalence classes under row and column permutations. If G is the group that permutes Latin squares of order n by all possible interchanges of rows and… (More)

In [3]s the first author obtained an expression for the number of equivalence classes induced on the set of ft x ft Latin squares under row and column permutations. The first purpose of this paper is to point out that the results of [3] do not hold for all n, but rather that they hold only if n is a prime.* The second purpose of this paper is, in the case… (More)

- Charles Laywine, Gary L. Mullen
- Ars Comb.
- 2002

- Charles Laywine, Gary L. Mullen
- J. Comb. Theory, Ser. A
- 1992

- Charles Laywine, J. P. Mayberry
- J. Comb. Theory, Ser. B
- 1988

- Charles Laywine
- Des. Codes Cryptography
- 1993

- Charles Laywine
- Discrete Mathematics
- 1993

- Charles Laywine
- Discrete Mathematics
- 2001

- Charles Laywine, Gary L. Mullen
- Ars Comb.
- 2001

- ‹
- 1
- ›