Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (Q1086843): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q238454 |
Changed an Item |
||
Property / author | |||
Property / author: Richard Pollack / rank | |||
Normal rank |
Revision as of 12:01, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) |
scientific article |
Statements
Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (English)
0 references
1986
0 references
The number of distinct order types of simple numbered configurations of n points in \({\mathbb{R}}^ d\) is shown to be less than \(n^{d(d+1)n}.\) The number of combinatorially distinct labeled simplicial polytopes with n vertices in \({\mathbb{R}}^ d\) is less than \(n^{d(d+1)n}.\) The number of distinct configurations of n points in general position in \({\mathbb{R}}^ d\) is less than \(n^{2d^ 2n}\).
0 references
order types of simple numbered configurations
0 references
combinatorially distinct labeled simplicial polytopes
0 references
points in general position
0 references