The largest small \(n\)-dimensional polytope with \(n+3\) vertices. (Q1395826): Difference between revisions

Denote by \(V(n,k)\) the maximum \(n\)-dimensional volume of a convex polytope~\(P\) in the \(n\)-dimensional Euclidean space with~\(k\) vertices, where~\(P\) is required to have Euclidean diameter at most one. The numbers \(V(n,k)\) are unknown for most values of~\(n\) and~\(k\). Graham showed in 1975 that, in the two-dimensional plane, the polygons with maximal area are not the regular ones, in general. In this paper, the authors claim solutions to the problem for the cases \(k=n+2\) and \(k=n+3\). Unfortunately, there are some severe errors in the proofs. In fact, there might appear an erratum in J. Comb. Theory, Ser.~A in the near future.