• Corpus ID: 238744404

Nonstandard $n$-distances based on certain geometric constructions

  title={Nonstandard \$n\$-distances based on certain geometric constructions},
  author={Gergely Kiss and Jean-Luc Marichal},
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… 

Figures and Tables from this paper


On the best constants associated with n-distances
We pursue the investigation of the concept of $n$-distance, an $n$-variable version of the classical concept of distance recently introduced and investigated by Kiss, Marichal, and Teheux. We
An extension of the concept of distance as functions of several variables
This note provides and discusses an extension of the concept of distance, called n-distance, as functions of n variables, which is a natural generalization of the triangle inequality.
On the history of the Euclidean Steiner tree problem
The history of the Euclidean Steiner tree problem, which is the problem of constructing a shortest possible network interconnecting a set of given points in the Euclidean plane, goes back to Gergonne
Encyclopedia of Distances
This book begins with several metrics in classical geometry, then proceeds to applications of distance in fields like algebra and probability, eventually working through applied mathematics, computer science, physics and chemistry, social science, and even art and religion.
A generalization of the concept of distance based on the simplex inequality
We introduce and discuss the concept of n-distance, a generalization to n elements of the classical notion of distance obtained by replacing the triangle inequality with the so-called simplex
Steiner Minimal Trees
While a spanning tree spans all vertices of a given graph, a Steiner tree spans a given subset of vertices. In the Steiner minimal tree problem, the vertices are divided into two parts: terminals and