ISSN:
1420-8903
Keywords:
Primary 08A25
;
Secondary 02C05
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Let A be a finite set,n 〉 1 andD $$ \subseteq $$ A n . We say thatf:D → A is a partial Sheffer function of size |D| if eachf*: A n → A agreeing withf onD is Sheffer (or complete that is 〈A; f〉 primal), i.e. iff* generates allg:A m → A (m = 1, 2, ⋯) via repeated composition. The least size of a partial Sheffer function is shown to be |A| + 2 and all partial Sheffer functions of this size are exhibited. This shows how surprisingly little information onf is needed to ensure thatf is Sheffer and, at the same time, gives a description of large classes of Sheffer functions.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01818558
Permalink