We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a computation in the circumscribing case or to the computation of an outer radius of a lower-dimensional simplex. In the second part of the paper, we use this characterization to determine the sequence of outer $(n-1)$-radii of regular simplices (which are the radii of smallest enclosing cylinders). This settles a question which arose from the incidence that a paper by Weißbach (1983) on this determination was erroneous. In the proof, we first reduce the problem to a constrained optimization problem of symmetric polynomials and then to an optimization problem in a fixed number of variables with additional integer constraints.
We study properties of the volume of projections of the $n$-dimensional cross-polytope $\crosp^n = \{ x \in \R^n \mid |x_1| + \dots + |x_n| \leqslant 1\}.$ We prove that the projection of $\crosp^n$ onto a $k$-dimensional coordinate subspace has the maximum possible volume for $k=2$ and for $k=3.$ We obtain the exact lower bound on the volume of such a projection onto a two-dimensional plane. Also, we show that there exist local maxima which are not global ones for the volume of a projection of $\crosp^n$ onto a $k$-dimensional subspace for any $n > k \geqslant 2.$
We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products such that specified faces (e.g. all the k-faces) are ``strictly preserved'' under projection. Thus, starting from an arbitrary neighborly simplicial (d-2)-polytope Q on n-1 vertices we construct a deformed n-cube, whose projection to the last dcoordinates yields a neighborly cubical d-polytope. As an extension of thecubical case, we construct matrix representat…
Let $P_n$ be an $n$-dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project $P_n$ onto a random, uniformly distributed linear subspace of dimension $d\geq 2$. We prove that the expected number of $k$-dimensional faces of the resulting random polytope is an increasing function of $n$. As a corollary, we show that the expected number of $k$-faces of the Gaussian polytope is an increasing function of the number of points used to generate the polytope. Similar results are obtained for the symmetric Gaussian polytope and the…
We investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the existence of a geometric realization of a polytope with the given combinatorial type such that a linear projection to e-space strictly preserves the k-skeleton. Building on the work of Sanyal (2009), we develop a general framework to calculate obstructions to the existence of such realizations using topological combinatorics. Our obstructions take the form of gr…
Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$ are translates of each other. We also prove an analogous result for sections by showing that $P=Q$ or $P=-Q$, provided the polytopes contain the origin in their interior and their sections, $P \cap H$, $Q \cap H$, by every $k$-dimensional subspace $H$, are congruent.
We provide an affirmative answer to a problem posed by Barvinok and Veomett, showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of a sub-exponential dimension. Moreover, we establish a lower bound of the Banach-Mazur distance between n-dimensional projections of sections of an N-dimensional simplex and a certain convex symmetric body, which is sharp up to a logarithmic factor for all N>n.
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner and Weismantel, namely the finiteness of the number of maximal lattice polytopes without interior lattice points. Moreover, we show that in dimension four and higher some of these finitely many polytopes are not maximal as convex …
We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum absolute value of ell on B within a factor of epsilon sqrt{d}. We also discuss approximations of convex bodies by projections of spectrahedra, that is, by projections of sections of the cone of positive semidefinite matrices by affine subspaces.
Simultaneously generalizing both neighborly and neighborly cubical polytopes, we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to that of a product of r simplices. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal and Ziegler's "projecting deformed products" construction to products of arbitrary simple polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1. Using topological obstructions similar to those introduced by Sanyal to bound the number of vertices of Minkowski sums, we show that thi…
Let $P\subset \mathbb R^n$ be a belt polytope, that is a polytope whose normal fan coincides with the fan of some hyperplane arrangement $\mathcal A$. Also, let $G:\mathbb R^n\to\mathbb R^d$ be a linear map of full rank whose kernel is in general position with respect to the faces of $P$. We derive a formula for the number of $j$-faces of the ``projected'' polytope $GP$ in terms of the $j$-th level characteristic polynomial of $\mathcal A$. In particular, we show that the face numbers of $GP$ do not depend on the linear map $G$ provided a general position assumption is satisfied. Furthermore, …
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved later to give a nice tool for graph embeddings. On the other hand, it is the theory of hyperbolic virtual polytopes which arose from an old uniqueness conjecture for convex bodies (A. D. Alexandrov's problem): suppose that a constant $C$ separates (non-strictly) everywhere the principal curvature radii of a smooth 3-dimensional convex body $K$. Then $K$ is neces…
The article considers the problem of existence and uniqueness of centrally symmetrical convex body for which the projection curvature radius function coincides with a given flag function. A necessary and sufficient condition is found that ensures a positive answer. An algorithm for construction the body in question is proposed
Let C = C(l_1, ..., l_n) be the n-dimensional orthogonal cross-polytope whose axes are of length l_1,..., l_n. Subject to the condition \sum l_i^2 = 1, the mean width of C is minimised when l_i = 1/sqrt{n} for every i, and it is maximised when C is at most two dimensional. As a corollary, a lower bound on the mean width of a general convex body K is derived in terms of the successive inner radii of K. A more general result is presented for Gaussian random vectors.
Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check combinatorial criterion for the facets of $\mathcal{P}$. Our proof relates triangulations of $\mathcal{P}$ to triangulations of its "shadow", a projection to a lower-dimensional space determined by $U$. In particular, we obtain a formula relating the volume of $\mathcal{P}$ with the volume of its shadow. This leads to an exact formula for the volume of a polytope …
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 geometry can be expressed through these conic intrinsic volumes. A list of such quantities includes internal and external solid angles of regular simplices and crosspolytopes, the probability that a (symmetric) Gaussian random polytope or the Gaussian zonotope contains a given point, the expected number of faces of the intersection of a regular polytope with a rand…
Let $K$ and $L$ be origin-symmetric convex integer polytopes in $\mathbb{R}^n$. We study a discrete analogue of the Aleksandrov projection problem. If for every $u\in \mathbb{Z}^n$, the sets $(K\cap \mathbb{Z}^n)|u^\perp$ and $(L\cap \mathbb{Z}^n)|u^\perp$ have the same number of points, is then $K=L$? We give a positive answer to this problem in $\mathbb{Z}^2$ under an additional hypothesis that $(2K\cap \mathbb{Z}^2)|u^\perp$ and $(2L\cap \mathbb{Z}^2)|u^\perp$ have the same number of points.
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in d). We discuss approximations of a convex body by an ellipsoid, by an algebraic hypersurface, by a projection of a polytope with a controlled number of facets, and by a section of the cone of positive semidefinite quadratic forms. We illustrate some of the results on the Traveling Salesman Polytope, an example of a complicated convex body studied in combinato…
Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <= n-1. It is also shown that the following two statements are equivalent: (i) For every polytope Q inside K having at most d+1 vertices, L contains a translate of Q. (ii) For every d-dimensional subspace W, the orthogonal projection of the set L onto W contains a translate of the corresponding projection of the set K onto W. It is then shown that, if K is a co…
In this work we study upper bounds for the ratio of successive inner and outer radii of a convex body K. This problem was studied by Perel'man and Pukhov and it is a natural generalization of the classical results of Jung and Steinhagen. We also introduce a technique which relates sections and projections of a convex body in an optimal way.
Using the geodesic distance on the $n$-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in $\mathbb{R}^{n+1}$, so we also get the expected number of faces of a random inscribed polytope. We find that the expectati…
In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to both questions and suggest an algorithm of construction of the body. Also we find a representation of the support function of a convex body by projection curvature radii.
A classical theorem of Alon and Milman states that any $d$ dimensional centrally symmetric convex body has a projection of dimension $m\geq e^{c\sqrt{\ln{d}}}$ which is either close to the $m$-dimensional Euclidean ball or to the $m$-dimensional cross-polytope. We extended this result to non-symmetric convex bodies.
Case Western Reserve University（凯斯西储大学）；Institut de Mathématiques de Jussieu-PRG, Sorbonne Université（索邦大学数学研究所Jussieu-PRG）；Institut de Mathématiques de Toulouse, Université de Toulouse & CNRS（图卢兹数学研究所，图卢兹大学与法国国家科学研究中心）；ECMWF（欧洲中期天气预报中心）
