No label defined (Q4950117)

Let \(L^d_p\) be the \(d\)-dimensional linear space with \(p\)-norm. Suppose a graph \(G= (V,E)\) is embedded in this space in the sense that \(V\) is any finite set of points and each edge \(vv'\) is a segment \(\{tv+ (1- t)v': 0\leq t\leq 1\}\), \(v,v'\in V\). The length of \(G\) is defined by \(L_p(G)= \sum_{vv'\in V}\|v-v'\|_p\). Steiner's problem of minimal trees is: Given a finite set \(N\) in \(L^d_p\), find a connected graph \(G= (V,E)\) such that \(N\subseteq V\) and the total length of all edges of \(E\) is minimal. Such a network is called a Steiner Minimal Tree (SMT). If we connect pairs of given points only, we find a Minimum Spanning Tree (MST). The Steiner ratio \(m(d,p)\) of \(L^d_p\) is the infimum of the quotients of the lengths of SMT and MST over all finite sets. In this paper an estimate of the numbers \(m(2,p)\) is obtained. It is also proved that \(m(d,2)\geq m(W(d,q),q)\) for any dimension \(d\) and even integer \(q\), where \[ W(d,q)= \text{Min}\{d':\text{there is an isometric embedding }L^d_2\to L^{d'}_q\}. \] For the entire collection see [Zbl 0942.00019].