Sciweavers

Share
COMBINATORICS
2006

Counting d-Polytopes with d+3 Vertices

8 years 11 months ago
Counting d-Polytopes with d+3 Vertices
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
Éric Fusy
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICS
Authors Éric Fusy
Comments (0)
books