Related papers: On Convex Polytopes in the d-dimensional Space Con…
The intrinsic volumes of Gaussian polytopes are considered. A lower variance bound for these quantities is proved, showing that, under suitable normalization, the variances converge to strictly positive limits. The implications of this…
We provide a streamlined proof and improved estimates for the weak multivariate Gnedenko law of large numbers on concentration of random polytopes within the space of convex bodies (in a fixed or a high dimensional setting), as well as a…
We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godberson's conjecture, near-optimal…
Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…
We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…
This paper focuses on the investigation of volumes of large Coxeter hyperbolic polyhedron. First, the paper investigates the smallest possible volume for a large Coxeter hyperbolic polyhedron and then looks at the volume of pyramids with…
The aim of the paper is to develop a unified algebraical approach to representing the Minkowski difference for convex polyhedra. Namely, there is proposed an exact analytical formulas of the Minkowski difference for convex polyhedra with…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
In this paper, we deal with a hyperspace selection problem in the setting of connected spaces. We present two solutions of this problem illustrating the difference between selections for the nonempty closed sets, and those for the at most…
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…
We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…
We demonstrate the equivalence of two classes of $D$-invariant polynomial subspaces introduced in [8] and [9], i.e., these two classes of subspaces are different representations of the breadth-one $D$-invariant subspace. Moreover, we solve…
The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…
Here I present a method how intersections of a certain density matrix of rank two with the zero-polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and…
We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces…