Related papers: Hunting for reduced polytopes

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…

Given a convex body $Q$ (structuring element) and a set $A$ in a Euclidean space, we consider the $Q$-Minkowski content of $A$. It is defined as the usual isotropic Minkowski content of $A$, but where the Euclidean ball is replaced by $Q$.…

Motivated by the search for reduced polytopes, we consider the following question: For which polytopes exists a vertex-facet assignment, that is, a matching between vertices and non-incident facets, so that the matching covers either all…

Complex structures can only form in a universe that allows for bound states. While this is clearly observed in three-dimensions, added degrees of freedom in a higher-dimensional space preclude the immediate assumption that binding…

We give an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.

In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…

For some self-similar sets K in d-dimensional Euclidean space we obtain certain lower bounds for the lower Minkowski dimension of K+E in terms of the lower Minkowski dimension of E.

The three-dimensional linear regression problem is a problem of finding a spacial straight line best fitting a group of points in three-dimensional Euclidean space. This problem is considered in the present paper and a solution to it is…

Would 3D space be non-Euclidean in physical reality then curved metric should destroy the Aharonov-Bohm Effect.

In this note we gather and review some facts about existence of toric spaces over 3-dimensional simple polytopes. First, over every combinatorial 3-polytope there exists a quasitoric manifold. Second, there exist combinatorial 3-polytopes,…

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

Let $P\subset\R^d$ be a $d$-dimensional polytope. The {\em realization space} of~$P$ is the space of all polytopes $P'\subset\R^d$ that are combinatorially equivalent to~$P$, modulo affine transformations. We report on work by the first…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

In 3-dimensional Euclidean space, Scherk second surfaces are singly periodic embedded minimal surfaces with four planar ends. In this paper, we obtain a natural generalization of these minimal surfaces in any higher dimensional Euclidean…

We introduce a Grothendieck group $E_n$ for bounded polytopes in $\mathbb R^n$. It differs from the usual Euclidean scissors congruence group in that lower-dimensional polytopes are not ignored. We also define an analogous group $L_n$ using…

This article presents a new way to classify geodesics on a cone in the Euclidean 3-space. This proof is obtained considering our main result, which establishes the necessary and sufficient conditions that a curve in space must satisfy: to…

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…

We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…

We improve the best lower bounds on the chromatic number of Euclidean space in small dimensions. The new results depend on extensive computations in Sage.

In this paper, we show the existence of uniform rational lc polytopes for foliations with functional boundaries in dimension $\leq 3$. As an application, we prove the global ACC for foliated threefolds with arbitrary DCC coefficients. We…