Related papers: Minimum polyhedron with $n$ vertices

It is well known that every quasi-Fuchsian manifold admits at least one closed incompressible minimal surface, and at most finitely many of them. In this paper, for any prescribed integer $N>0$, we construct a quasi-Fuchsian manifold which…

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

We provide a characterization of the Clifford Torus in S3 via moving frames and contact structure equations. More precisely, we prove that minimal surfaces in S3 with constant contact angle must be the Clifford Torus. Some applications of…

We prove that the least area of the non-contractible immersed spheres is no more than $4\pi$ in any oriented compact manifold with dimension $n+2\leq 7$ which satisfies $R\geq 2$ and admits a map to $\mathbf S^2\times T^n$ with nonzero…

In this paper, we prove that if a quasi-Fuchsian 3-manifold $M$ contains a simple closed geodesic with complex length $\Lscr=l+i\theta$ such that $\theta/l\gg{}1$, then it contains at least two minimal surfaces which are incompressible in…

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere,…

In this paper, we discuss about the minimal non-faces of the triangulations $\Delta^d$ by the path of the standard unit $d$-cube. Moreover, we will show that $\Delta^d$ is shellable and the result of the calculation for $h$-polynomial of…

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

We verify that if $M$ is a compact minimal hypersurface in $\mathbb{S}^{n+1}$ whose squared length of the second fundamental form satisfying $0\leq |A|^2-n\leq\frac{n}{22}$, then $|A|^2\equiv n$ and $M$ is a Clifford torus. Moreover, we…

Let M be a closed minimal hypersurface in 5-dimensional Euclidean sphere with constant nonnegative scalar curvature. We prove that, if the sum of the cubes of all principal curvatures and the number of distinct principal curvatures are…

Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…

We show that there is a constant $c$ such that any 3-uniform hypergraph $\mathcal H$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of…

Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…

The monostatic property of polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in a focus of research ever since Conway and Guy \cite{Conway} published the proof of the existence of the…

We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of…

We present and apply a method for disproving the existence of polyhedral immersions in $\mathbb{R}^3$ of certain triangulations on non-orientable surfaces. In particular, it is proved that neither of the two vertex-minimal, neighborly…

We prove that, for sufficiently large $n$, every graph of order $n$ with minimum degree at least $0.852n$ has a fractional edge-decomposition into triangles. We do this by refining a method used by Dross to establish a bound of $0.9n$. By a…

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…