Abstract
A threshold Boolean function is a Boolean function defined on {0, l}n whose On-vertices and Off-vertices are strictly separable by a hyperplane in Rn. Threshold logic is the main source for study of threshold Boolean functions, while Boolean algebraic methods have been the classical tools to study these objects.
Recently, we have claimed there exists a purely geometric approach to these linearly separable Boolean functions. The principal motivation to this claim is the fact that these functions are just linearly separable cubical complexes and their place is convex geometry and polytopes. Here, we present a brief overview of a few results justifying this new connection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Caiseda and L. González, “A Computer Generation of Polytopes that are Sections of the 5-cube”, to appear in Congressus Numerantium.
C. K. Chow, “On the Characterization of Threshold Functions”, SCTLD (1961), 34–38.
C. K. Chow, “Boolean Functions Realizable with Single Threshold Devices”, Proc. IRE 49 (1961), 370–371.
C. C. Elgot, “Truth Functions Realizable by Single Threshold Organs”, SCTLD (1961), 225–245.
M. R. Emamy-K. and L. Lazarte, “On the Cut-complexes of the 5-cube”, Discrete Math. 78 (1989), 239–256.
M. R. Emamy-K., C. Caiseda, P. Pei, “Enumeration of Threshold Pseudo-Boolean Functions for 5 and 6-cubes”, to appear.
M. R. Emamy-K. and C. Caiseda, “An Efficient Algorithm for Characterization of Cut-complexes”, Congressus Numerantium 84 (1991).
G. Ewald and G. C. Shephard, “Stellar Subdivisions of boundary Complexes of Convex polytopes”, Math. Ann. 210 (1974), 7–16.
E. Goto, Japanese Patent, 1954.
E. Goto, Threshold Logic, Lecture Notes, MIT, 1963.
B. Grunbaum, Convex Polytopes, Inter-Science, London, 1967.
S. T. Hu, Threshold Logic, University of California Press, Berkeley, 1965.
S. Muroga, Threshold Logic and its Applications, Wiley Interscience, Toronto, 1971.
J. Von Neumann, U. S. Patent (1954).
J. Von Neumann, “Probabilistic Logics and the Synthesis of Reliable Organism from Unreliable Components”, Automata Studies, Princeton University Press, 1956, p.p. 43–98.
R. O. Winder, “Threshold Logic”, Ph.D. Thesis, Mathematics Department, Princeton University, May 1962.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Emamy-K., M.R. (1995). A New Connection Between Convex Geometry and Threshold Logic. In: Colbourn, C.J., Mahmoodian, E.S. (eds) Combinatorics Advances. Mathematics and Its Applications, vol 329. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3554-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3554-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3556-6
Online ISBN: 978-1-4613-3554-2
eBook Packages: Springer Book Archive