On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero
classification
🧮 math.CO
cs.DM
keywords
spaceavoidingcontainingconvexd-dimensionalpolytopeszerocertain
read the original abstract
The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in the space.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.