A correction to "The largest small n-dimensional polytope with n+3 vertices": [J. Combin. Theory Ser. A 102 (2003) 401-409]


In the above-referenced paper, we aim to determine the maximal volume of the n-dimensional polytopes of diameter 1 with at most n + 3 vertices. As noted by Volker Kaibel the proofs of Theorems 2.1 and 4.1 are incomplete. More precisely, he pointed out to us that in higher dimensions there are combinatorial inequivalent cases we have not considered. The… (More)
DOI: 10.1016/j.jcta.2005.06.001


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.