Related papers: Optimal embedded and enclosing isosceles triangles
We consider an isoperimetric problem involving the smallest positive and largest negative curl eigenvalues on abstract ambient manifolds, with a focus on the standard model spaces. We in particular show that the corresponding eigenvalues on…
It is known that $\sum\limits_{i =1}^\infty {1/ i^2}={\pi^2/6}$. Meir and Moser asked what is the smallest $\epsilon$ such that all the squares of sides of length $1$, $1/2$, $1/3$, $\ldots$ can be packed into a rectangle of area…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
We consider the optimal covering of fractal sets in a two-dimensional space using ellipses which become increasingly anisotropic as their size is reduced. If the semi-minor axis is \epsilon and the semi-major axis is \delta, we set…
A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…
By prior work, there is a distributed algorithm that finds a maximal fractional matching (maximal edge packing) in $O(\Delta)$ rounds, where $\Delta$ is the maximum degree of the graph. We show that this is optimal: there is no distributed…
One of the central applications for quantum annealers is to find the solutions of Ising problems. Suitable Ising problems, however, need to be formulated such that they, on the one hand, respect the specific restrictions of the hardware…
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in $\mathbb{R}^n$ was studied extensively for the last 70 years. In this paper, we…
In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…
In this article we consider the isoperimetric problem for partitioning the plane into three disjoint domains, one having unit area and the remaining two having infinite area. We show that the only solution, up to rigid motions of the plane,…
We answer an open problem in the \emph{American Mathematical Monthly} about covering large triangles. Given a triangle $T$ of any triangular shape with a selected side length between $n \in \mathbb{N}$ and $n+1$, Baek and Lee proved that…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
This paper deals with the celebrated Euclidean theorem about isosceles triangles, comparing different proofs.
We prove existence of three unique ``max-exparabolas'' to a triangle. Each of these parabolas is internally tangent to one edge and the two other sides. Among all like parabolas, it is characterized by having maximal parameter. We use this…
The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…
Using quantum annealing to solve an optimization problem requires minor embeddings of a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of…
This article considers a one-parameter family of circles F_C, which has the interesting property that the null isocline of the family is the largest member of the family. This family of circles is bounded and we consider the problem of…
A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…
We consider the problem of optimally insulating a given domain $\Omega$ of ${\mathbb{R}}^d$; this amounts to solve a nonlinear variational problem, where the optimal thickness of the insulator is obtained as the boundary trace of the…