“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 99
School of Mathematics
  Title:   A new connection between convex geometry and threshold logic
  Author(s):  M. R. Emamy-K
  Status:   In Proceedings
  Proceeding: Combinatorics Advances
  Vol.:  329
  Year:  1996
  Pages:   121-128
  Editor:  Math. Appl. (C.J. Colbourn and E.S. Mahmoodian, eds.)
  Publisher(s):   Kluwer Academic Press, Dordrecht
  Supported by:  IPM
A threshold Boolean function is a Boolean function defined on {0,1}n whose On-vertices and Off-vertices are strictly separable by a hyperplane in ℜn. 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.

Download TeX format
back to top
scroll left or right