Volume 18, issue 5 (2018)

Download this article
Download this article For screen
For printing
Recent Issues

Volume 19
Issue 2, 533–1078
Issue 1, 1–532

Volume 18, 7 issues

Volume 17, 6 issues

Volume 16, 6 issues

Volume 15, 6 issues

Volume 14, 6 issues

Volume 13, 6 issues

Volume 12, 4 issues

Volume 11, 5 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 4 issues

Volume 7, 4 issues

Volume 6, 5 issues

Volume 5, 4 issues

Volume 4, 2 issues

Volume 3, 2 issues

Volume 2, 2 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editorial Interests
Editorial Procedure
Submission Guidelines
Submission Page
Ethics Statement
Author Index
To Appear
ISSN (electronic): 1472-2739
ISSN (print): 1472-2747
Other MSP Journals
Self-dual binary codes from small covers and simple polytopes

Bo Chen, Zhi Lü and Li Yu

Algebraic & Geometric Topology 18 (2018) 2729–2767

The work of Volker Puppe and Matthias Kreck exhibited some intriguing connections between the algebraic topology of involutions on closed manifolds and the combinatorics of self-dual binary codes. On the other hand, the work of Michael Davis and Tadeusz Januszkiewicz brought forth a topological analogue of smooth, real toric varieties, known as “small covers”, which are closed smooth manifolds equipped with some actions of elementary abelian 2–groups whose orbit spaces are simple convex polytopes. Building on these works, we find various new connections between all these topological and combinatorial objects and obtain some new applications to the study of self-dual binary codes, as well as colorability of polytopes. We first show that a small cover Mn over a simple n–polytope Pn produces a self-dual code in the sense of Kreck and Puppe if and only if Pn is n–colorable and n is odd. Then we show how to describe such a self-dual binary code in terms of the combinatorics of Pn. Moreover, we can construct a family of binary codes Bk(Pn), for 0 k n, from an arbitrary simple n–polytope Pn. Then we give some necessary and sufficient conditions for Bk(Pn) to be self-dual. A spinoff of our study of such binary codes gives some new ways to judge whether a simple n–polytope Pn is n–colorable in terms of the associated binary codes Bk(Pn). In addition, we prove that the minimum distance of the self-dual binary code obtained from a 3–colorable simple 3–polytope is always 4.

self-dual code, polytope, small cover
Mathematical Subject Classification 2010
Primary: 57M60, 57R91, 57S25, 94B05
Received: 27 March 2017
Revised: 25 February 2018
Accepted: 23 March 2018
Published: 22 August 2018
Bo Chen
School of Mathematics and Statistics
Huazhong University of Science and Technology
Zhi Lü
School of Mathematical Sciences
Fudan University
Li Yu
Department of Mathematics and IMS
Nanjing University