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

We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .

In the 1950's, English painter Anthony Hill described drawings of complete graphs $K_n$ in the plane having precisely $$H(n) = \tfrac{1}{4}\lfloor \tfrac{n}{2}\rfloor \, \lfloor \tfrac{n-1}{2}\rfloor \, \lfloor \tfrac{n-2}{2}\rfloor…

In this paper, I mainly prove the following results. For every energy value below the minimum of the first, second and third critical value, each bounded component of the regularized energy hypersurface of the Lagrange problem under some…

We consider an arrangement $\A$ of $n$ hyperplanes in $\R^d$ and the zone $\Z$ in $\A$ of the boundary of an arbitrary convex set in $\R^d$ in such an arrangement. We show that, whereas the combinatorial complexity of $\Z$ is known only to…

We prove that the Hilbert geometry of a convex domain in ${\mathbb R}^n$ has bounded local geometry, i.e., for a given radius, all balls are bilipschitz to a euclidean domain of ${\mathbb R}^n$. As a consequence, if the Hilbert geometry is…

The aim of this paper is twofold. First, we cut off a part of a convex surface by a plane near a ridge point and characterize the limiting behavior of the surface measure in $S^2$ induced by this part of surface when the plane approaches…

This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…

Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…

By using a suitable triple cover we show how to possibly model the construction of a minimal surface with positive genus spanning all six edges of a tetrahedron, working in the space of BV functions and interpreting the film as the boundary…

Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently…

Let D be a compact convex domain in the plane. P\'olya & Szeg\"o and, independently, Levi & Pan defined the point p in D that is "best insulated from the boundary C of D". We compute p in the case when C is an isosceles right triangle,…

For a convex domain K in the complex plane C, the well-known general Markov inequality asserting that a polynomial p of degree n ||p'|| < c(K) n^2 ||p|| holds. On the other hand for polynomials in general, ||p'|| can be arbitrarily small as…

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

We consider the functional given by the product of the first Dirichlet eigenvalue and the torsional rigidity of planar domains normalized by the area. This scale invariant functional was studied by P\'olya and Szeg\H{o} in 1951 who showed…

A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ sides is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons,…

Motivated by questions in number theory, Myerson asked how small the sum of 5 complex nth roots of unity can be. We obtain a uniform bound of O(n^{-4/3}) by perturbing the vertices of a regular pentagon, improving to O(n^{-7/3}) infinitely…

The minimal area for surfaces whose border are rectangular and circular loops are calculated using the Hamilton-Jacobi (HJ) equation. This amounts to solve the HJ equation for the value of the minimal area, without calculating the shape of…

Let \Sigma be a k-dimensional minimal surface in the unit ball B^n which meets the unit sphere orthogonally. We show that the area of \Sigma is bounded from below by the volume of the unit ball in R^k. This answers a question posed by R.…