Related papers: In polytopes, small balls about some vertex minimi…
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…
It is proved by Brendle in [4] that the equatorial disk $D^k$ has least area among $k$-dimensional free boundary minimal surfaces in the Euclidean ball $B^n$. By comparing the excess of free boundary minimal surfaces with the excess of the…
In 2021, Henk, Schymura and Xue introduced packing minima, associated with a convex body and a lattice, as packing counterparts to the covering minima of Kannan and Lov\'asz. Motivated by conjectures on the volume inequalities for the…
Isoperimetric regions minimize the size of their boundaries among all regions with the same volume. In Euclidean and Hyperbolic space, isoperimetric regions are round balls. We show that isoperimetric regions in two and three-dimensional…
A convex body $R$ in the hyperbolic plane is reduced if any convex body $K\subset R$ has a smaller minimal width than $R$. We examine the area of a family of hyperbolic reduced $n$-gons, and prove that, within this family, regular $n$-gons…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
The aim of this paper is to prove the existence of minimizers for a variational problem involving the minimization under volume constraint of the sum of the perimeter and a non-local energy of Wasserstein type. This extends previous partial…
Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…
We review several results related to the characterization of polyhedra in hyperbolic 3-space. In particular we present Rivin's theorem that gives a characterization of compact convex hyperbolic polyhedra, and Hodgson's proof of the Adreev's…
The lattice size of a lattice polygon $P$ was introduced and studied by Schicho, and by Castryck and Cools in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an algebraic curve. In this…
Under mild assumptions on the kernel $K\ge0$, the non-local $K$-perimeter $P_K$ satisfies the monotonicity property on nested convex bodies, i.e., if $A\subset B\subset\mathbb{R}^n$ are two convex bodies, then $P_K(A)\le P_K(B)$. In this…
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…
We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…
In this paper we study regularity and topological properties of volume constrained minimizers of quasi-perimeters in $\sf RCD$ spaces where the reference measure is the Hausdorff measure. A quasi-perimeter is a functional given by the sum…
We characterization hyperbolic metrics on compact surfaces with boundary using a variational principle. As a consequence, a new parametrization of the Teichmuller space of compact surface with boundary is produced. In the new…
The reverse isoperimetric problem asks for existence and properties of bounded convex sets in a Riemannian manifold which maximise the perimeter under all those sets of fixed volume which roll freely in a ball of some given radius. If the…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any…
In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…