Diameter preserving surjections in the geometry of matrices
Abstract
We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping φ:' between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of are at a distance equal to the diameter of if, and only if, their images are at a distance equal to the diameter of '. This result is then applied to the graphs arising from the adjacency relations of spaces of rectangular matrices, spaces of Hermitian matrices, and Grassmann spaces (projective spaces of rectangular matrices).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.