On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero
Kelmans, Alexander · Rubinov, Anatoliy
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.