On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero
Combinatorics
2013-12-24 v2 Discrete Mathematics
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.
Cite
@article{arxiv.1201.4512,
title = {On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero},
author = {Alexander Kelmans and Anatoliy Rubinov},
journal= {arXiv preprint arXiv:1201.4512},
year = {2013}
}
Comments
8 pages, some typos corrected