Premium
Weak Uniquely Completable Sets for Finite Groups
Author(s) -
Bedford David,
Johnson Matthew
Publication year - 2000
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/s0024609399006761
Subject(s) - mathematics , mathematics subject classification , order (exchange) , set (abstract data type) , latin square , subject (documents) , finite set , group (periodic table) , existential quantification , combinatorics , finite group , pure mathematics , discrete mathematics , mathematical analysis , computer science , fermentation , economics , programming language , rumen , chemistry , food science , organic chemistry , finance , library science
Keedwell has shown that none of the groups of order less than 5 has a weak uniquely completable set. We prove that a weak uniquely completable set exists in a latin square based on a finite group if and only if the group is of order greater than 5. 1991 Mathematics Subject Classification 05B15.