Faces of the cone of Euclidean distance matrices: Characterizations, structure and induced geometry
โ Scribed by Pablo Tarazaga
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 216 KB
- Volume
- 408
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we obtain new characterizations of the faces of the cone of Euclidean distance matrices. In one case the characterization is based on a special subspace associated with each distance matrix, in other case on linear restrictions of coordinate matrices. We also relate the faces to the supporting hyperplanes of the cone, and we show how the supporting hyperplanes induce certain geometry on the configurations that belong to that face.
๐ SIMILAR VOLUMES
Denote by G = (V, โผ) a graph which V is the vertex set and โผ is an adjacency relation on a subset of V ร V . In this paper, the good distance graph is defined. Let (V, โผ) and (V , โผ ) be two good distance graphs, and ฯ : V โ V be a map. The following theorem is proved: ฯ is a graph isomorphism โ ฯ i
## Abstract The structural determination of modified mononucleosides is important for understanding the chemistry, structure and functional changes that they impart to the nucleic acids in which they occur. Empirical analyses of __J__~(HH)~ couplings have been used to describe nucleoside conformati