Related papers: A lower bound for Heilbronn's triangle-problem

We confirm two conjectures of Lassak on the area of reduced spherical polygons. The area of every reduced spherical non-regular $n$-gon is less than that of the regular spherical $n$-gon of the same thickness. Moreover, the area of every…

In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…

We construct nontrivial unbounded domains $\Omega$ in the hyperbolic space $\mathbb{H}^N$, $N \in \{2,3,4\}$, bifurcating from the complement of a ball, such that the overdetermined elliptic problem \begin{equation} -\Delta_{\mathbb{H}^N}…

We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…

Let N be a complete, simply-connected surface of constant curvature \kappa \leq 0. Moreover, suppose that \Omega and \tilde{\Omega} are strictly convex domains in N with the same area. We show that there exists an area-preserving…

We show that the hot spots conjecture of J. Rauch holds for acute triangles if one of the angles is not larger than $\pi/6$. More precisely, we show that the second Neumann eigenfunction on those acute triangles has no maximum or minimum…

Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n^2) \times O(n^2)$, as shown by…

Let $P$ be a set of $n$ points in the plane. We compute the value of $\theta\in [0,2\pi)$ for which the rectilinear convex hull of $P$, denoted by $\mathcal{RH}_\theta(P)$, has minimum (or maximum) area in optimal $O(n\log n)$ time and…

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More…

We prove some refined asymptotic estimates for postive blowing up solutions to $\Delta u+\epsilon u=n(n-2)u^{\frac{n+2}{n-2}}$ on $\Omega$, $\partial_\nu u=0$ on $\partial\Omega$; $\Omega$ being a smooth bounded domain of $\rn$, $n\geq 3$.…

By work of Uhlenbeck, the largest principal curvature of any least area fiber of a hyperbolic $3$-manifold fibering over the circle is bounded below by one. We give a short argument to show that, along certain families of fibered hyperbolic…

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…

In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The…

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

In hyperbolic space $H^n$ we set a geodesic ball of radius $\rho$. Consider a $k$ dimensional minimal submanifold passing through the origin of the geodesic ball with boundary lies on the boundary of that geodesic ball. We prove that its…

There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…

A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…