Graph homomorphisms on rectangular matrices over division rings I
Abstract
Let D be a division ring, and let Dm× n be the set of m× n matrices over D. Two matrices A,B∈ Dm× n are adjacent if rank(A-B)=1. By the adjacency, Dm× n is a connected graph. Suppose that m,n,m',n'≥2 are integers and D' is a division ring. Using the weighted semi-affine map and algebraic method, we characterize graph homomorphisms from Dm× n to D'm'× n' (where |D|≥ 4) under some weaker conditions.
0
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.