... these results, we include a proof of Theorem 1.1 for completeness.2.1 A characterization for faces For convenience, let [n] := {1, 2 . . . , n} be the set of vertices of CP(n, d), numbered ac-cording ... thennkq=ω=acbdq=ω.Proof of Theorem 1.3. For r 2 a divisor of n, let ω be a primitive rth root of unity andlet Crbe the subgroup of order r of C. Let d = 2t. First, we claim ... Gale’s evennesscondition for cyclic polytopes CP(n, d) in Section 2. For even d, we prove the CSP for faces of CP(n, d) in Section 3. For odd d, we enumerate the faces of CP(n, d) that areinvariant...