Related papers: Hunting for reduced polytopes
The width of a closed convex subset of Euclidean space is the distance between two parallel supporting planes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still…
Conditions, related to the so-called bending problem are considered for hypersurfaces of a pseudo-Euclidean space. Corresponding theorems are proved.
This is a very brief report on recent developments on the Dirichlet problem for the minimal surface system and minimal cones in Euclidean spaces. We shall mainly focus on two directions: (1) Further systematic developments after…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…
This paper deals with the global well-posedness of the 3D axisymmetric Euler equations for initial data lying in some critical Besov spaces
Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…
This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…
This paper proves sharp lower bounds on a resonance counting function for obstacle scattering in even-dimensional Euclidean space without a need for trapping assumptions. Similar lower bounds are proved for some other compactly supported…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
We find a one-to-one correspondence between full extrinsic symmetric spaces in (possibly degenerate) inner product spaces and certain algebraic objects called (weak) extrinsic symmetric triples. In particular, this yields a description of…
We prove a correspondence theorem for singular tropical surfaces in real three space, which recovers singular algebraic surfaces in an appropriate toric three-fold that tropicalize to a given singular tropical surface. Furthermore, we…
We answer to a question posed recently by B. Lovitz and F. Petrov, proving the conjectured sufficient minimality and uniqueness condition of the 3-tensor decomposition.
We prove a recent conjecture by Ulas on reducible polynomial substitutions.
We prove that sufficiently collapsed, closed and irreducible three-dimensional Alexandrov spaces are modeled on one of the eight three-dimensional Thurston geometries. This extends a result of Shioya and Yamaguchi, originally formulated for…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
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…
In the polytope membership problem, a convex polytope $K$ in $\mathbb{R}^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given any query point $q \in \mathbb{R}^d$, it is possible to determine efficiently…
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…