Related papers: Steinhaus conditions for convex polyhedra
By a map $p:Q\to X$ of involutive quantales is meant a homomorphism $p^*:X\to Q$. Calling a map $p$ weakly open if $p^*$ has a left adjoint $p_!$ which satisfies the Frobenius reciprocity condition (i.e., $p_!$ is a homomorphism of…
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located…
It is proved that a convex polyhedral scatterer of impedance type can be uniquely determined by the electric far-field pattern of a non-vanishing incident field. The incoming wave is allowed to bean electromagnetic plane wave, a vector…
Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…
The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…
We show that an $n$-dimensional surface whose entropy is close to that of an $n$-dimensional plane is close in Hausdorff distance to some $n$-dimensional plane at every scale. Moreover we show that self-expanders of low entropy converge in…
We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed…
We have completely rewritten the paper, and corrected the proofs. We construct an exponential map at any point in the (n-1)-skeleton minus the (n-2)-skeleton of an n-dimensional Riemannian polyhedron. We have added allover the…
For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…
For an embedded singly periodic minimal surface M with genus bigger than or equal to 4 and annular ends, some weak symmetry hypotheses imply its congruence with one of the Hoffman-Wohlgemuth examples. We give a very geometrical proof of…
We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
In this article we study adjoint hypersurfaces of geometric objects obtained by intersecting simple polytopes with few facets in $\mathbb{P}^5$ with the Grassmannian $\mathrm{Gr}(2,4)$. These generalize the positive Grassmannian, which is…
Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…
In a complete simply connected Riemannian manifold X of pinched negative curvature, we give a sharp criterion for a subset C to be the epsilon-neighbourhood of some convex subset of X, in terms of the extrinsic curvatures of the boundary of…
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…