Diameter preserving surjections in the geometry of matrices
Wen-ling Huang, Hans Havlicek

TL;DR
This paper proves that certain distance-preserving surjective maps between graphs, including those from matrix spaces, are actually isomorphisms, under specific diameter-related conditions.
Contribution
It establishes that diameter-preserving surjections between restricted graphs are isomorphisms, with applications to matrix and Grassmannian graphs.
Findings
Surjective maps preserving diameter-related distances are isomorphisms.
Results apply to graphs from matrix spaces and Grassmann spaces.
Provides a characterization of structure-preserving maps in these geometries.
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Topics in Algebra · Geometric and Algebraic Topology
