Mathematics – Combinatorics
Scientific paper
2012-01-21
Mathematics
Combinatorics
8 pages
Scientific paper
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.
Kelmans Alexander
Rubinov Anatoliy
No associations
LandOfFree
On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero 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 On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-482638