Graph homomorphisms on rectangular matrices over division rings II
Abstract
Let Dm× n be the set of m× n matrices over a division ring D. Two matrices A,B∈ Dm× n are adjacent if rank(A-B)=1. By the adjacency, Dm× n is a connected graph. Suppose D, D' are division rings and m,n,m',n'≥2 are integers. We determine additive graph homomorphisms from Dm× n to D'm'× n'. When |D|≥ 4, we characterize the graph homomorphism : Dn× n→ D'm'× n' if (0)=0 and there exists A0∈ Dn× n such that rank((A0))=n. We also discuss properties and ranges on degenerate graph homomorphisms. If f:Dm× n→ D'm'× n' (where min\m,n\=2) is a degenerate graph homomorphism, we prove that the image of f is contained in a union of two maximal adjacent sets of different types. For the case of finite fields, we obtain two better results on degenerate graph homomorphisms.
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.