## 13.3Symmetric Cycles in the Hypercube Graphs

In this section we turn to an investigation of the combinatorial properties of the vertex set {1, –1}t of the hypercube graph H(t, 2) and of its symmetric cycles.

Let R be a symmetric cycle in H(t, 2), with its distance vectors zT,R associated with the topes T ∈ {1, –1}t.

According to eq. (13.5), we have

Get *Pattern Recognition on Oriented Matroids* now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.