Related papers: The Number of Triangles Needed to Span a Polygon E…

A convex polygon $A$ is related to a convex $m$-gon $K= \bigcap_{i=1}^m k_i^+$, where $k_1^+,..., k_m^+$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^+,...,a_l$, each of which is a…

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the…

We prove that closed surfaces of all topological types, except for the non-orientable odd-genus ones, can be minimally embedded in the Riemannian product of a sphere and a circle of arbitrary radius. We illustrate it by obtaining some…

In this paper we continue the investigation of finding the max/min polygons which can be inscribed in a given triangle. Here we are concerned with equilateral triangles. This may seem uninteresting or benign at first, but there are some…

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

We prove that every unit area convex pentagon is contained in a convex quadrilateral of area no greater than $3/\sqrt{5}$, and that every unit area convex hexagon is contained in a convex pentagon of area no greater than $7/6$. Both results…

We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…

For closed odd-dimensional manifolds with sectional curvature less or equal than -1, we define the minimal surface entropy that counts the number of surface subgroups. It attains the minimum if and only if the metric is hyperbolic.…

We consider surfaces embedded in a 3D contact sub-Riemannian manifold and the problem of the finiteness of the induced distance (i.e., the infimum of the length of horizontal curves that belong to the surface). Recently it has been proved…

We construct small covers and quasitoric manifolds over $n$-dimensional simple polytopes which allow proper colorings of facets with $n$ colors. We calculate Stiefel-Whitney classes of these manifolds as obstructions to immersions and…

Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

For 3 $\leq$ n $\leq$ 7, we prove that a bumpy closed Riemannian n-manifold contains a sequence of connected embedded closed minimal surfaces with unbounded area.

For a compact 3-manifold $M$ which is a circle bundle over a compact Riemann surface $\Sigma$ with even Euler number $e(M)$, and with a Riemannian metric compatible with the bundle projection, there exists a compact minimal surface $S$ in…

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…