Related papers: Ceva's triangle inequalities
If P is a point inside triangle ABC, then the cevians through P divide triangle ABC into six smaller triangles. We give theorems about the relationship between the radii of the circles inscribed in these triangles.
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
We consider the most general correlations that can be obtained by a group of parties whose causal relations are well-defined, although possibly probabilistic and dependent on past parties' operations. We show that, for any fixed number of…
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. As an application of these results we can deduce a complete…
We determine the most general group of equivalence transformations for a family of differential equations defined by an arbitrary vector field on a manifold. We also find all invariants and differential invariants for this group up to the…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…
Pairwise comparison matrices often exhibit inconsistency, therefore many indices have been suggested to measure their deviation from a consistent matrix. A set of axioms has been proposed recently that is required to be satisfied by any…
In this short note the authors give answers to the three open problems formulated by Wu and Srivastava [{\it Appl. Math. Lett. 25 (2012), 1347--1353}]. We disprove the Problem 1, by showing that there exists a triangle which does not…
Some inequalities for different types of convexity are established.
In this article we prove some theorems related to the triplets of triangles, homological two by two. These theorems will be used later to build triplets of triangles two by two tri-homological.
We study curves obtained by tracing triangle centers within special families of triangles, focusing on centers and families that yield (semi-)invariant triangle curves, meaning that varying the initial triangle changes the loci only by an…
Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
We prove inequalities involving intrinsic and extrinsic radii and diameters of tetrahedra.
We study the convex hull of a set $S\subset \mathbb{R}^n$ defined by three quadratic inequalities. A simple way of generating inequalities valid on $S$ is to take nonnegative linear combinations of the defining inequalities of $S$. We call…
The paper is devoted to the description of family of scalene triangles for which the triangle formed by the intersection points of bisectors with opposite sides is isosceles. We call them Sharygin triangles. It turns out that they are…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
We define transversal tropical triangles (affine and projective) and characterize them via six inequalities to be satisfied by the coordinates of the vertices. We prove that the vertices of a transversal tropical triangle are tropically…