Complete subsets of mappings over a finite domain
Published online by Cambridge University Press: 24 October 2008
Extract
Improved sufficient conditions are developed for the functional completeness of a set F of functions with variables and values ranging over N = {1, 2, …, n}, where n ≥ 3. In particular, F is complete if it generates a triply transitive group of permutations of N and contains either (i) only a single function, or (ii) at least one function satisfying the Slupecki conditions, the latter apart from certain exceptional cases. These are shown by a detailed investigation to occur only when n = 3 or when n is a power of 2 and all functions of F are linear in each variable, relative to some representation of N as a vector space over Z2.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 62 , Issue 4 , October 1966 , pp. 597 - 611
- Copyright
- Copyright © Cambridge Philosophical Society 1966
References
REFERENCES
- 7
- Cited by