Related papers: The covariogram determines three-dimensional conve…

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…

The deformation space of real projective structures parametrizes the space of the convex real projective structures on an orbifold. The Coxeter orbifold can be obtained $D^2(;n_1,n_2,n_3,n_4)\times\mathbb{R}$ by embedding the Coxeter…

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…

The characterization of Kirkwood-Dirac (KD) classicality or non-classicality is very important in quantum information processing. In general, the set of KD classical states with respect to two bases is not a convex polytope[J. Math. Phys.…

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…

In this paper, we obtain the best possible value of the absolute constant $C$ such that for every isotropic convex body $K \subseteq \mathbb{R}^n$ the following inequality (which was proved by Klartag and reduces the hyperplane conjecture…

This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

The space of m-harmonic polynomials related to a Coxeter group G and a multiplicity function m on its root system is defined as the joint kernel of the properly gauged invariant integrals of the corresponding generalised quantum…

We review recent progress on two closely related sets of questions concerning convex co-compact hyperbolic manifolds, or convex domains in those manifolds, such as their convex core. The first set of questions is to what extent the…

Let $K$ and $L$ be two convex bodies in ${\mathbb R^4}$, such that their projections onto all $3$-dimensional subspaces are directly congruent. We prove that if the set of diameters of the bodies satisfy an additional condition and some…

Let X be an affine spherical variety, possibly singular, and $L^+X$ its arc space. The intersection complex of $L^+X$, or rather of its finite-dimensional formal models, is conjectured to be related to special values of local unramified…

A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…

We consider the following measure of symmetry of a convex n-dimensional body K: $\rho(K)$ is the smallest constant for which there is a point x in K such that for partitions of K by an n-1-dimensional hyperplane passing through x the ratio…

Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…

In the polytope membership problem, a convex polytope $K$ in $\mathbb{R}^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given any query point $q \in \mathbb{R}^d$, it is possible to determine efficiently…

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…