Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Fermat-Torricelli problem in the case of three-point sets in normed planes (2210.04374v1)

Published 9 Oct 2022 in math.MG and math.DG

Abstract: In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the sum of distances to arbitrarily given points in d-dimensional real normed spaces. Various generalizations of this problem are outlined, current methods of solving and some recent results in this area are presented. The aim of the article is to find an answer to the following question: in what norms on the plane is the solution of the Fermat-Torricelli problem unique for any three points. The uniqueness criterion is formulated and proved in the work, in addition, the application of the criterion on the norms set by regular polygons, the so-called lambda planes, is shown.

Summary

We haven't generated a summary for this paper yet.