Related papers: On the Morley's triangle
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
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…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…
Let S be an arbitrary scheme. We define biextensions of 1-motives by 1-motives which we see as the geometrical origin of morphisms from the tensor product of two 1-motives to a third one. If S is the spectrum of a field of characteristic 0,…
For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…
We describe all triangles that shares the same circumcircle and Euler circle. Although this two circles do not form a poristic pair of circles, we find a poristic circle "in-between" that enable to solve this problem using Poncelet porism.
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two…
In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
We study the tropicalization of intersections of plane curves, under the assumption that they have the same tropicalization. We show that the set of tropical divisors that arise in this manner is a pure dimensional balanced polyhedral…
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.
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…
We study several models of random geometric subdivisions arising from the model of Diaconis and Miclo (2011). In particular, we show that the limiting shape of an indefinite subdivision of a quadrilateral is a.s.\ a parallelogram. We also…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this…
The problem we are dealing with is the following: find two sequences $a_n$ and $b_n$ such that the average of the first $b_n$ triangular numbers (starting with the triangular number 1) is still a triangular number, precisely the $a_n$-th…
Techniques from representation theory, symbolic computational algebra, and numerical algebraic geometry are used to find the minimal generators of the ideal of the trifocal variety. An effective test for determining whether a given tensor…
Given two elliptic curves, each of which is associated with a projection map that identifies opposite elements with respect to the natural group structure, we investigate how their corresponding projective images of torsion points…