Adjacency preserving mappings on real symmetric matrices
Peter Legi\v{s}a

TL;DR
This paper characterizes maps between real symmetric matrices that preserve adjacency, specifically those that maintain rank-one differences, for dimensions two and higher.
Contribution
It provides a complete characterization of adjacency-preserving maps on real symmetric matrices for all dimensions n ≥ 2.
Findings
Maps preserving adjacency are characterized for n=2 and n>2.
The structure of such maps is explicitly described.
Results extend understanding of matrix transformations preserving rank properties.
Abstract
Let denote the space of all real symmetric matrices. For n=2 or n>2 we characterize maps F from to which preserve adjacency, i.e. if rank(A-B)=1, then rank(F(A)-F(B))=1.
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
TopicsAdvanced Topics in Algebra · Matrix Theory and Algorithms · Finite Group Theory Research
