Nonstandard n-distances based on certain geometric constructions

DOI10.1007/S13366-022-00623-5MaRDI QIDQ6380234arXivFDO

Authors Gergely Kiss, Jean-Luc Marichal

Publication date 13 October 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S13366-022-00623-5

Mathematics Subject Classification ID

Systems of functional equations and inequalities (39B72) General theory of distance geometry (51K05)

arXiv classification

math.MG

Abstract: The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical constructions. In particular, our study shows to which extent the computation of the best constant associated with an $n$-distance may sometimes be difficult and tricky. It also reveals that two important graph theoretical concepts, namely the total length of the Euclidean Steiner tree and the total length of the minimal spanning tree constructed on $n$ points, are instances of $n$-distances.

This page was built for publication: Nonstandard $n$-distances based on certain geometric constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380234)