Article ID Journal Published Year Pages File Type
4653794 European Journal of Combinatorics 2013 6 Pages PDF
Abstract
The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in Rd “containing” and “avoiding” zero provided that their vertex sets are subsets of a given finite set S of points in Rd. This paper is motivated by a question about these quantities raised by E. Boros and V. Gurvich in 2002.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On convex polytopes in Rd containing and avoiding zero
Authors
, ,