A geometric connection to threshold logic via cubical lattices

M. Emamy-K ()

Annals of Operations Research, 2011, vol. 188, issue 1, 153 pages

Abstract: A cut-complex is a cubical complex whose vertices are strictly separable from the rest of the vertices of the n-cube by a hyperplane of R n . These objects render geometric presentations for threshold Boolean functions, the core objects of study in threshold logic. By applying cubical lattices and geometry of rotating hyperplanes, we prove necessary and sufficient conditions to recognize the cut-complexes with 2 or 3 maximal faces. This result confirms a positive answer to an old conjecture of Metropolis-Rota concerning cubical lattices. Copyright Springer Science+Business Media, LLC 2011

Keywords: Cut-complexes; Cubical lattices; Threshold logic; Convex polytopes (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0593-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:188:y:2011:i:1:p:141-153:10.1007/s10479-009-0593-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0593-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().