Related papers: Optimal embedded and enclosing isosceles triangles
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
In any triangle, the perpendicular side bisectors meet the corresponding internal angle bisectors on the circumcircle. If we take those three points as the vertices of a new triangle and repeat the operation indefinitly, we end up in the…
In this work we study the fencing problem consisting of finnding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by the so-called…
We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…
We use Menger's Theorem and K\"onig's Line Colouring Theorem to show that in any tripartite graph with two complete (bipartite) sides the maximum number of pairwise edge-disjoint triangles equals the minimum number of edges that meet all…
An embedded twisted paper cylinder of aspect ratio $\lambda$ is a smooth isometric embedding of a flat $\lambda \times 1$ cylinder into $\R^3$ such that the images of the boundary components are linked. We prove that for such an object to…
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…
Paul Erd\H{o}s posed the question of whether every measurable planar set of infinite Lebesgue measure contains the four vertices of an isosceles trapezoid of unit area. In this paper, we provide an affirmative answer to this question.…
We introduce a notion of embedding codimension of an arbitrary local ring, establish some general properties, and study in detail the case of arc spaces of schemes of finite type over a field. Viewing the embedding codimension as a measure…
We show optimal triangulations for piecewise linear (PWL) approximations of indefinite quadratic functions over the plane. Optimal triangulations have minimum triangle density while allowing a PWL approximation that fulfills a prescribed…
A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…
It is well known that among all closed bounded curves in the plane with the given perimeter, the circle encloses the maximum area. There are many proofs in the literature. In this article we have given a new proof using some ideas of Demar.
In this work, we prove that any triangle whose three sidelengths are integers, cannot have all of its three medians also having integral lengths.This is done in Proposition 2.In Section 5, we give precise(i.e.necessary and…
In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in $\mathbb{R}^d$. We prove that the problem is polynomially…
We prove that for every surface $\Sigma$ of Euler genus $g$, every edge-maximal embedding of a graph in $\Sigma$ is at most $O(g)$ edges short of a triangulation of $\Sigma$. This provides the first answer to an open problem of Kainen…
Let $\Poly$ be a simple polygon with $n$ vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded faces of $\triang$ and whose edges connect those faces…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.