Problems of distance geometry and convex properties of quadratic maps (Q1346137): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of quadratic maps and Hessians of smooth maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4323601 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3770273 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4274004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5461825 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Toeplitz-Hausdorff Theorem Explained / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4046802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5521075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4324980 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3345333 / rank | |||
Normal rank |
Latest revision as of 12:21, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Problems of distance geometry and convex properties of quadratic maps |
scientific article |
Statements
Problems of distance geometry and convex properties of quadratic maps (English)
0 references
10 January 1996
0 references
Let \(G = (V, E, \rho)\) be a graph. The elements of \(V\), \(E\) are called vertices, edges respectively. \(\rho : E \to \mathbb{N}\) is a mapping that determines the weights of the edges. \(G\) is said to be \(d\)-realizable if its vertices can be chosen in the Euclidean space \(\mathbb{R}^d\) so that the Euclidean distance between every pair of adjacent vertices \(v_i\), \(v_j\) is equal to the weight of the connecting edge. The following results are obtained: Let \(|E |= k\). If \(G\) is \(d\)-realizable for some \(d\) then it is \(d_0\)-realizable for \(d_0 := [(\sqrt {8k + 1} - 1) {1\over 2}]\). The image of the `rigidity map' \(\mathbb{R}^{dn} \to \mathbb{R}^k\) is a convex set in \(\mathbb{R}^k\) provided \(d \geq d_0\). These results are corollaries of a convexity theorem which may be considered as an extension of the Toeplitz-Hausdorff theorem.
0 references
distance geometry
0 references
quadratic maps
0 references
Euclidean space
0 references
distance
0 references
convexity
0 references
0 references