Related papers: Hunting for reduced polytopes
In this note, we given a version of Pick's theorem for the simple lattice polygon in two-dimensional subspace of R^3.
In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…
A method to visualize polytopes in a four dimensional euclidian space $(x,y,z,w)$ is proposed. A polytope is sliced by multiple hyperplanes that are parallel each other and separated by uniform intervals. Since the hyperplanes are…
We study three-dimensional Alexandrov spaces with a lower curvature bound, focusing on extending three classical results on three-dimensional manifolds: First, we show that a closed three-dimensional Alexandrov space of positive curvature,…
A lower bound for the number of 3-periodical billiard trajectories in a manifold embedded in Euclidean space is obtained.
We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the…
We consider the question of existence of embedded doubly periodic minimal surfaces in Euclidean 3-space with Scherk-type ends, surfaces that topologically are Scherk's doubly periodic surface with handles added in various ways. We extend…
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…
This paper is aimed at presenting a systematic survey of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). In the present paper, there are…
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial subsets of 0/1-vectors. These polytopes are special knapsack-polytopes. It turns out that they have remarkable extremal properties. In…
There are significant differences between Helmholtz and Hodge's decomposition theorems, but both share a common flavor. This paper is a first step to bring them together. We here produce Helmholtz theorems for differential 1-forms and…
Rotations on the 3-dimensional Euclidean vector-space can be represented by real quaternions, as was shown by Hamilton. Introducing complex quaternions allows us to extend the result to elliptic and hyperbolic rotations on the Minkowski…
In 1957, Hadwiger made the famous conjecture that any convex body of $n$-dimensional Euclidean space $\mathbb{E}^n$ can be covered by $2^n$ smaller positive homothetic copies. Up to now, this conjecture is still open for all $n\geq 3$.…
Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…
We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…
In Euclidean space condensers with variable potential levels and the presence of a free part at the boundary are studied. The asymptotic formula of the modulus of such condenser is obtained when the plates are pulled into points. The…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
A dimension reduction for the hyperbolic space is established. When points are far apart an embedding with bounded distortion into the hyperbolic plane is achieved.