相关论文: Triangle inequalities in path metric spaces

There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…

This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…

In this paper we study an application of an information distance between two measurements to the problem of non-contextuality and local realism. We postulate the triangle principle which states that any information distance is well defined…

A certain real number, depending on two neighbouring sides of a quadrilateral and the diagonal meeting these two sides at their common point, is shown to be invariant under affinity. As an application we demonstrate a nice formula for the…

In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…

We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…

In this article, we introduce a notion of curvature, denoted by $ k_X(T)$, for a metric triple $T$ inside a (possibly discrete) metric space $X$. Such a notion enables us to consider curvature information of any metric space, including…

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…

For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…

In 2017 M. Bessenyei and Z. P\'ales introduced a definition of a triangle function which generates a concept of a generalized triangle inequality in semimetric spaces. Inspired by this concept we discuss already known inequalities in metric…

The first main results of this note establish forms of the hyperbolic laws of cosines and sines for certain classes of quadrilaterals and pentagons in the hyperbolic plane, having at least one ideal vertex and right angles at non-ideal…

We show that, in the Teichm\"uller metric, "thin-framed triangles are thin"---that is, under suitable hypotheses, the variation of geodesics obeys a hyperbolic-like inequality. This theorem has applications to the study of random walks on…

The equality constraint a+b+c=1 for random triangle sides corresponds to breaking a stick in two places. An analog a^2+b^2+c^2=1 has a remarkable feature: the bivariate density for angles coincides with that for 3D Gaussian triangles.…

The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

We define a complete Riemannian manifold X to be large-scale conformally rigid if all groups that are quasi-isometric to some complete Riemannian manifold of bounded geometry conformal to X are quasi-isometric to X. We prove that many…

We prove a set of inequalities that interpolate the Cauchy-Schwarz inequality and the triangle inequality. Every nondecreasing, convex function with a concave derivative induces such an inequality. They hold in any metric space that…

Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

This paper presents a unified metric-based framework for triangle geometric inequalities using barycentric coordinates. By interpreting classical inequalities as squared distances between points(a process termed metricization)we derive and…