ISSN:
1420-8903
Keywords:
Primary 08A25, 02C05
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract LetA be a finite set,n≥1 andD⊆A n. We say thatf :D →A is a functionally complete partial operation of size |D| if eachf*:A n →A agreeing withf onD is functionally complete. Such an operation of sized represents thus a family of $$|A|^{(|A|^n - d)} $$ functionally complete operations. We investigate the least possible size of functionally complete partial groupoids. Such groupoids not defined on a row or column have size either |A|+1 or |A|+2 or are of size at least 2|A|−2. We prove that |A|+1 is the least size of such a groupoid and completely determine those of size |A|+1. As one might expect, these groupoids are very special. This study shows how surprisingly little information is needed to ensure that a groupoid is functionally complete and, at the same time, gives a description of large classes of functionally complete groupoids.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02189623
Permalink
