English

Graph homomorphisms on rectangular matrices over division rings II

Combinatorics 2017-02-21 v1

Abstract

Let Dm×n{\mathbb{D}}^{m\times n} be the set of m×nm\times n matrices over a division ring D\mathbb{D}. Two matrices A,BDm×nA,B\in {\mathbb{D}}^{m\times n} are adjacent if rank(AB)=1{\rm rank}(A-B)=1. By the adjacency, Dm×n{\mathbb{D}}^{m\times n} is a connected graph. Suppose D,D\mathbb{D}, \mathbb{D}' are division rings and m,n,m,n2m,n,m',n'\geq2 are integers. We determine additive graph homomorphisms from Dm×n{\mathbb{D}}^{m\times n} to Dm×n{\mathbb{D}'}^{m'\times n'}. When D4|\mathbb{D}|\geq 4, we characterize the graph homomorphism φ:Dn×nDm×n\varphi: {\mathbb{D}}^{n\times n}\rightarrow {\mathbb{D}'}^{m'\times n'} if φ(0)=0\varphi(0)=0 and there exists A0Dn×nA_0\in {\mathbb{D}}^{n\times n} such that rank(φ(A0))=n{\rm rank}(\varphi(A_0))=n. We also discuss properties and ranges on degenerate graph homomorphisms. If f:Dm×nDm×nf:{\mathbb{D}}^{m\times n}\rightarrow {\mathbb{D}'}^{m'\times n'} (where min{m,n}=2{\rm min}\{m,n\}=2) is a degenerate graph homomorphism, we prove that the image of ff 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.

Keywords

Cite

@article{arxiv.1702.05703,
  title  = {Graph homomorphisms on rectangular matrices over division rings II},
  author = {Li-Ping Huang and Kang Zhao},
  journal= {arXiv preprint arXiv:1702.05703},
  year   = {2017}
}

Comments

33 pages

R2 v1 2026-06-22T18:22:14.787Z