Related papers: The covariogram determines three-dimensional conve…

The cross covariogram g_{K,L} of two convex sets K and L in R^n is the function which associates to each x in R^n the volume of the intersection of K and L+x. Very recently Averkov and Bianchi [AB] have confirmed Matheron's conjecture on…

The covariogram g_K of a convex body K in E^d is the function which associates to each x in E^d the volume of the intersection of K with K+x. In 1986 G. Matheron conjectured that for d=2 the covariogram g_K determines K within the class of…

The covariogram $g_{K}$ of a convex body $K$ in $\mathbb{R}^n$ is the function which associates to each $x\in\mathbb{R}^n$ the volume of the intersection of $K$ with $K+x$. Determining $K$ from the knowledge of $g_K$ is known as the…

The covariogram g_K(x) of a convex body K \subseteq E^d is the function which associates to each x \in E^d the volume of the intersection of K with K+x. Matheron asked whether g_K determines K, up to translations and reflections in a point.…

Let \phi be a real-valued valuation on the family of compact convex subsets of \mathbb{R}^n and let K be a convex body in \mathbb{R}^n. We introduce the \phi -covariogram g_{K,\phi} of K as the function associating to each x \in…

The covariogram of a compact set A contained in R^n is the function that to each x in R^n associates the volume of A intersected with (A+x). Recently it has been proved that the covariogram determines any planar convex body, in the class of…

A finite subset $K$ of $\mathbb{Z}^d$ is said to be lattice-convex if $K$ is the intersection of $\mathbb{Z}^d$ with a convex set. The covariogram $g_K$ of $K\subseteq \mathbb{Z}^d$ is the function associating to each $u \in \integer^d$ the…

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

For a convex body $K\subset\R^n$ and $i\in\{1,...,n-1\}$, the function assigning to any $i$-dimensional subspace $L$ of $\R^n$, the $i$-dimensional volume of the orthogonal projection of $K$ to $L$, is called the $i$-th projection function…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…

We give a description of faces of all codimensions for the cones of weights of rings of semi-invariants of quivers. For a triple flag quiver and faces of codimension 1 this reduces to the result of Knutson-Tao-Woodward on the facets of the…

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…