Related papers: Minimum area isosceles containers

In this work, we study the tensor ring decomposition and its associated numerical algorithms. We establish a sharp transition of algorithmic difficulty of the optimization problem as the bond dimension increases: On one hand, we show the…

In this paper we study the following problem: Given $k$ disjoint sets of points, $P_1, \ldots, P_k$ on the plane, find a minimum cardinality set $\mathcal{T}$ of arbitrary rectangles such that each rectangle contains points of just one set…

It is a well-known result in pointfree topology that every locally compact frame is spatial. Whether this result extends to MT-algebras (McKinsey-Tarski algebras) was an open problem. We resolve it in the negative by constructing a locally…

Using a ramified cover of the two-sphere by the torus, we prove a local optimal inequality between the diastole and the area on the two-sphere near a singular metric. This singular metric, made of two equilateral triangles glued along their…

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…

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

Among all triangles of given diameter, the equilateral triangle is shown to minimize the sum of the first $n$ eigenvalues of the Dirichlet Laplacian, for each $n \geq 1$. In addition, the first, second and third eigenvalues are each proved…

We discuss the existence of the angle between two curves in Teichm\"uller spaces and show that, in any infinite dimensional Teichm\"uller space, there exist infinitely many geodesic triangles each of which has the same three vertices and…

Let $\mathfrak{M}$ be a class of metric spaces. A metric space $Y$ is minimal $\mathfrak{M}$-universal if every $X\in\mathfrak{M}$ can be isometrically embedded in $Y$ but there are no proper subsets of $Y$ satisfying this property. We find…

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

The following class of problems arose out of vain attempts to show that the Pascal's triangle adic transformation has trivial spectrum. Partition a set of size $N$ into sets of size $S \equiv S(N)$ (ignoring leftovers). What is the…

We show that a topologically minimal disk in a tetrahedron with index $n$ is either a normal triangle, a normal quadrilateral, or a normal helicoid with boundary length 4(n+1). This mirrors geometric results of Colding and Minicozzi.

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…

We consider the problem of partitioning a two-dimensional flat torus $T^2$ into $m$ sets in order to minimize the maximal diameter of a part. For $m \leqslant 25$ we give numerical estimates for the maximal diameter $d_m(T^2)$ at which the…

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

It was proved by Ron Graham and the second author that for any coloring of the $N \times N$ grid using fewer than $\log \log N$ colours, one can always find a monochromatic isosceles right triangle, a triangle with vertex coordinates $(x,…

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider…

Lower bounds estimates are proved for the first eigenvalue for the Dirichlet Laplacian on arbitrary triangles using various symmetrization techniques. These results can viewed as a generalization of P\'olya's isoperimetric bounds. It is…

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…