Counting d-polytopes with d+3 vertices

Details Counting d-polytopes with d+3 vertices Counting d-polytopes with d+3 vertices

2005-11-18

arxiv.org/abs/math/0511466v1

Mathematics

Combinatorics

24 pages

Scientific paper

We completely solve the problem of enumerating combinatorially inequivalent $d$-dimensional polytopes with $d+3$ vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct, as pointed out in the new edition of Gr\"unbaum's book. We both correct the mistake of Lloyd and propose a more detailed and self-contained solution, relying on similar preliminaries but using then a different enumeration method involving automata. In addition, we introduce and solve the problem of counting oriented and achiral (i.e. stable under reflection) $d$-polytopes with $d+3$ vertices. The complexity of computing tables of coefficients of a given size is then analyzed. Finally, we derive precise asymptotic formulas for the numbers of $d$-polytopes, oriented $d$-polytopes and achiral $d$-polytopes with $d+3$ vertices. This refines a first asymptotic estimate given by Perles.

Affiliated with

Also associated with

No associations

Rating

Counting d-polytopes with d+3 vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting d-polytopes with d+3 vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting d-polytopes with d+3 vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-710916