Diameter preserving surjections in the geometry of matrices
โ Scribed by Wen-ling Huang; Hans Havlicek
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 151 KB
- Volume
- 429
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We examine surjective maps which preserve a fixed bounded distance in both directions on some classical dual polar spaces.
The diameter of a directed graph is the maximum of the lengths of the shortest paths between all pairs of vertices. A directed graph is said to be tightly oriented if it has the same diameter as its undirected image graph. Our main result is tight orientations for all sufficiently large toroids, exc
A direct method using O(kn 2 ) elementary operations to compute the k largest eigenvalues of an r-convexity preserving n ร n matrix, for all r = 0, 1, . . . , k, is presented.