Hostname: page-component-7479d7b7d-k7p5g Total loading time: 0 Render date: 2024-07-09T17:24:06.792Z Has data issue: false hasContentIssue false
  • English
  • Français

On The Number of Symmetry Types of Boolean Functions of n Variables

Published online by Cambridge University Press:  20 November 2018

David Slepian
David Slepian*
Affiliation:
Bell Telephone Laboratories, Inc. Murray Hill, New Jersey
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.

In recent years Boolean Algebra has come to play a prominent role in the analysis and synthesis of switching circuits [1; 4]. One general synthesis problem in which this algebra has proved useful is the following. Let there be given n input leads each of which can assume one of two possible states. It is desired to construct a network with these n input leads and a single output lead also capable of assuming either of two states. Furthermore, the state of the output lead for each of the 2n states of the input leads is prescribed.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 5 , 1953 , pp. 185 - 193
Copyright
Copyright © Canadian Mathematical Society 1953

References

1. Harvard Computation Laboratory Staff, Synthesis of electronic computing and control circuits (Cambridge, Mass., 1951).Google Scholar
2. Murnaghan, F. D., The theory of group representations (Baltimore, 1938).Google Scholar
3. Pólya, G., Sur les types des propositions composées, J. Symbolic Logic, 5 (1940), 98–103.Google Scholar
4. Shannon, C. E., The synthesis of two-terminal switching circuits, Bell System Tech. J., 28 (1949), 59–98.Google Scholar
5. Todd, J. A., The groups of symmetries of the regular polytopes, Proc. Cambridge Phil. Soc, 27 (1931) 212–231.Google Scholar
6. Young, A., On quantitative substitutional analysis, Proc. London Math. Soc. (2), 31 (1930), 273–288.Google Scholar