Cyclic polytopes, hyperplanes, and Gray codes
✍ Scribed by Tibor Bisztriczky; Károly Böröczky, Jr.; DavidS. Gunderson
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 219 KB
- Volume
- 78
- Category
- Article
- ISSN
- 0047-2468
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Consider the moment curve in the real euclidean space R d defined parametrically by the map γ : R → R d , t → γ (t) = (t, t 2 , . . . , t d ). The cyclic d-polytope C d (t 1 , . . . , t n ) is the convex hull of n > d different points on this curve. The matroidal analogs are the alternating oriented
A vertex coloring of a plane graph is called cyclic if the vertices in each face bounding cycle are colored differently. The main result is an improvement of the upper bound for the cyclic chromatic number of 3-polytopes due to Plummer and Toft, 1987 (J. Graph Theory 11 (1 987) 505-51 7). The proof
In memory of Professor Gian-Carlo Rota for his great contributions in combinatorial and discrete geometry A set of n-tuples over 8 is called a code over 8 or a 8 code if it is a 8 module. A particularly interesting family of 8 -cyclic codes are quadratic residue codes. We define such codes in terms