Graph homomorphisms on rectangular matrices over divisionrings I

Abstract: Let

m a t h b b D

be a division ring, and let

{m a t h b b D}^{m i m e s n}

be the set of

m i m e s n

matrices over

m a t h b b D

. Two matrices

A, B i n {m a t h b b D}^{m i m e s n}

are adjacent if

m r a n k (A - B) = 1

. By the adjacency,

{m a t h b b D}^{m i m e s n}

is a connected graph. Suppose that

m, n, m^{'}, n^{'} g e q 2

are integers and

m a t h b b D^{'}

is a division ring. Using the weighted semi-affine map and algebraic method, we characterize graph homomorphisms from

{m a t h b b D}^{m i m e s n}

to

{m a t h b b D^{'}}^{m^{'} i m e s n^{'}}

(where

| m a t h b b D | g e q 4

) under some weaker conditions.

Recommendations

Cited in

(2)

This page was built for publication: Graph homomorphisms on rectangular matrices over divisionrings I