Related papers: Points in a triangle forcing small triangles
The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…
Using ideas from the geometry of compression, we improve on the current upper and lower bounds of the Heilbronn triangle problem. In particular, let $\Delta(s)$ denote the minimal area of the triangle induced by $s$ points on a unit disk.…
We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…
We first introduce a configuration of arbitrary isogonal conjugates related to a known property concerning the spiral center of two pairs of isogonal conjugates. We then consider a special case where two conics are tangent at exactly two…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
First we argue in an informal, qualitative way that it is natural to enlarge space-time to five dimensions to be able to solve the problem of elementary particle masses. Several criteria are developed for the success of this program.…
In this paper we are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…
\"{O}zavsar and Cevikel(Fixed point of multiplicative contraction mappings on multiplicative metric space.arXiv:1205.5131v1 [math.GN] 23 may 2012)initiated the concept of the multiplicative metric space in such a way that the usual…
Two perpendicular segments which divide a given triangle into 4 regions of equal area is called a quadrisection of the triangle. Leonhard Euler proved in 1779 that every scalene triangle has a quadrisection with its triangular part on the…
Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…
This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results…
How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.
We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…
Let $X$ be a set of $n$ points in the plane, not all on a line. According to the Gallai-Sylvester theorem, $X$ always spans an \emph{ordinary line}, i.e., one that passes through precisely 2 elements of $X$. Given an integer $c\ge 2,$ a…
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…