Sciweavers

JCT
2011
93views more  JCT 2011»
13 years 1 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
DM
2011
211views Education» more  DM 2011»
13 years 2 months ago
A generalization of plexes of Latin squares
A k-plex of a latin square is a collection of cells representing each row, column, and symbol precisely k times. The classic case of k = 1 is more commonly known as a transversal....
Kyle Pula
ARSCOM
1999
97views more  ARSCOM 1999»
13 years 10 months ago
The Size of the Smallest Strong Critical Set in a Latin Square
A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
John A. Bate, G. H. John van Rees
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 10 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
DCC
2004
IEEE
14 years 10 months ago
On Non-Polynomial Latin Squares
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
Otokar Grosek, Peter Horák, Tran van Trung