Related papers: Hunting for reduced polytopes
In this manuscript we consider an isotropic modification for the Landau equation with Coulomb potential in three space dimensions. Global in time existence of weak solutions for even initial data is shown by employing a time…
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…
The aim of this work is to prove the global-in-time existence of weak solutions for a viscoelastic phase separation model in three space dimensions. To this end we apply the relative energy concept provided by [3]. We consider the case of…
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$.…
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended…
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,…
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…
We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.
In a paper from 2010, Budarina, Dickinson and Levesley studied the rational approximation properties of curves parametrized by polynomials with integral coefficients in Euclidean space of arbitrary dimension. Assuming the dimension is at…
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…
In this paper we consider the spherical slant helices in $R^3$. More- over, we show how could be obtained to a spherical slant helix and we give some spherical slant helix examples in Euclidean 3-space.
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…
We show that the volume of the inner $r$-neighborhood of a polytope in the $d$-dimensional Euclidean space is a pluri-phase Steiner-like function, i.e. a continuous piecewise polynomial function of degree $d$, proving thus a conjecture of…
We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…
We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
We study the problem of searching for a target at some unknown location in $\mathbb{R}^d$ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as…
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…
A very simple criterion to ascertain if (D-2)-surfaces are trapped in arbitrary D-dimensional Lorentzian manifolds is given. The result is purely geometric, independent of the particular gravitational theory, of any field equations or of…