Counting \(d\)-polytopes with \(d+3\) vertices (Q819185)

The article is devoted to the problem of counting combinatorially different \(n\)-polytopes with \(n+3\) vertices. The main result is the following. Theorem. Let \(c(n)\) be the number of combinatorially different \(n\)-polytopes with \(n+3\) vertices. Then the generating function \(P(x)=\sum\limits_n c(n)x^{n+3}\) reads as follows: \[ P(x)=-\frac{1}{1-x}\sum_{k\text{\,odd}} \frac{\varphi (k)}{4k} \ln\left( 1-\frac{2x^{3k}}{(1-2x)^{2k}}\right) +\frac{1}{1-x}\sum_{k\geq 1}\frac{\varphi (k)}{2k} \ln\left( \frac{1-x^k}{1-2x^k}\right) \] \[ + \frac{ x(x^2-x-1)(x^4-x^2+1) } { 2(1-x)^2(2x^6-4x^4+4x^2-1) } - \frac{ x(x^8-2x^7+x^6+3x^3-x^2-x+1)}{(1+x)^2(1-x)^6} \] where \(\varphi\) is the Euler totient function. The same problem was considered earlier by \textit{E. K. Lloyd} [Mathematika, Lond. 17, 120--132 (1970; Zbl 0214.02901)], see also \textit{B. Grünbaum} [Convex polytopes, New-York: Springer-Verlag (2003; Zbl 1033.52001)], but Lloyd's formulae were incorrect, so the author corrects mistakes of Lloyd. Moreover the author introduces and solves the problem of counting particular \(n\)-polytopes with \(n+3\) vertices which are referred to as oriented and achiral (stable under reflections). Besides precise asymptotic formulae for the numbers of \(n\)-polytopes, oriented \(n\)-polytopes and achiral \(n\)-polytopes with \(n+3\) vertices are derived, so some asymptotic estimates by Perles are refined [B. Grünbaum, loc. cit.].