You most probably arrived to this file by performing a search. These files, as well others, with publication information, can be found in Eduardo Sontag's Online Papers site. This problem arises in machine learning and has implications about the representational capabilities of some neural networks.
Introduction Let P be a regular polygon on n vertices.
We present two different proofs of this fact. This problem arises in machine learning. In the context of learning theory, this has implications about the representational capabilities of the two types of nets. A natural extension of the geometric problem is to consider the 2-coloring of arbitrary points in the plane. This abstract is organized as follows.