Hostname: page-component-76fb5796d-wq484 Total loading time: 0 Render date: 2024-04-25T16:36:16.037Z Has data issue: false hasContentIssue false
  • English
  • Français

Determination of a Subset from Certain Combinatorial Properties

Published online by Cambridge University Press:  20 November 2018

David G. Cantor  and
W. H. Mills
David G. Cantor
Affiliation:
Institute for Defense Analyses, Princeton, New Jersey and University of Washington
W. H. Mills
Affiliation:
Institute for Defense Analyses, Princeton, New Jersey and University of Washington
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let N be a finite set of n elements. A collection ﹛S1, S2, … , Sm﹜ of subsets of N is called a determining collection if an arbitrary subset T of N is uniquely determined by the cardinalities of the intersections Si ⋂ T, 1 ≤ i ≤ m. The purpose of this paper is to study the minimum value D(n) of m for which a determining collection of m subsets exists.

This problem can be expressed as a coin-weighing problem (1; 7).

In a recent paper Cantor (1) showed that D(n) = O(n/log log n), thus proving a conjecture of N. J. Fine (3) that D(n) = o(n). More recently Erdös and Rényi (2), Söderberg and Shapiro (7), Berlekamp, Mills, and Leo Moser have independently found proofs that D(n) = O(n/log n).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966 , pp. 42 - 48
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Cantor, David G., Determining a set from the cardinalities of its intersections with other sets, Can. J. Math., 16 (1964), 94–97.Google Scholar
2. Erdös, P. and Rényi, A., On two problems of information theory, Publ. Hung. Acad. Sci., 8 (1963), 241–254.Google Scholar
3. Fine, N. J., Solution E1399, Amer. Math. Monthly, 67 (1960), 697–698.Google Scholar
4. Lindström, B., On a combinatory detection problem, Publ. Hung. Acad. Sci., 9 (1964), 195–207.Google Scholar
5. Lindström, B., On a combinatorial problem in number theory, Can. Math. Bull., 4(1965), 477–490.Google Scholar
6. Ryser, H. J., Maximal determinants in combinatorial investigations, Can. J. Math., 8 (1956), 245–249.Google Scholar
7. Söderberg, Staffan and Shapiro, H. S., A combinatory detection problem, Amer. Math. Monthly, 70 (1963), 1066–1070.Google Scholar