Summary
Given a set, S, of Boolean n-vectors, one can choose k of the n coordinate positions and consider the set of k-vectors which results by keeping only the designated k positions of each vector, i.e., from k-projecting S. In this paper, we study the question of finding sets S as small as possible such that every k-projection of S yields all the 2k possible k-vectors. We solve this problem constructively and almost optimally for k=2 and all n. For k≧3, the constructive solutions we describe are much larger than an O(k 2k log n) nonconstructive upper bound which we derive. The nonconstructive approach allows us to generate fairly small sets S which have a very high probability of having the surjective k-projection property.
Similar content being viewed by others
References
Birkhoff, G.: Lattice Theory. Am. Math. Soc., Providence, Rhode Island, 1967
Chandra, A.K., Kou, L.T., Markowsky, G., Zaks, S.: On sets of Boolean n-vectors with all k-projections surjective. Technical report RC 8936, IBM Research, Yorktown Heights, July 1981
Tang, D.T., Woo, L.S.: Exhaustive test pattern generation with constant weight vectors. Technical report RC 9442, IBM Research, Yorktown Heights, June 1982
Tang, D.T., Chen, C.L.: Personal communication, Aug. 1982
Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6, 255–262 (1973)
Author information
Authors and Affiliations
Additional information
Work done while visiting the IBM Thomas J. Watson Research Center
Rights and permissions
About this article
Cite this article
Chandra, A.K., Kou, L.T., Markowsky, G. et al. On sets of Boolean n-vectors with all k-projections surjective. Acta Informatica 20, 103–111 (1983). https://doi.org/10.1007/BF00264296
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264296