Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T03:49:39.294Z Has data issue: false hasContentIssue false

The number of polytopes, configurations and real matroids

Published online by Cambridge University Press:  26 February 2010

Noga Alon
Affiliation:
Department of Mathematics, Tel Aviv University, Ramat Aviv, Israel 69978.
Get access

Abstract

We show that the number of combinatorially distinct labelled d-polytopes on n vertices is at most , as n/d → ∞. A similar bound for the number of simplicial polytopes has previously been proved by Goodman and Pollack. This bound improves considerably the previous known bounds. We also obtain sharp upper and lower bounds for the numbers of real oriented and unoriented matroids with n elements of rank d. Our main tool is a theorem of Milnor and Thorn from real algebraic geometry.

Information

Type
Research Article
Copyright
Copyright © University College London 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable