2020/02/10 by Jun Guo, Guo, Jun
Mathematics · Computer Science · #Finite Group Theory Research #Limits and Structures in Graph Theory #Coding theory and cryptography
paper · pdf · doi:10.48550/arxiv.2002.03560
Let h=∏i=1tpisi be its decomposition into a product of powers of distinct primes, and ℤh be the residue class ring modulo h. Let 1≤ r≤ m≤ n and ℤhm× n be the set of all m× n matrices over ℤh. The generalized bilinear forms graph over ℤh, denoted by \hboxBilr(ℤhm× n), has the vertex set ℤhm× n, and two distinct vertices A and B are adjacent if the inner rank of A-B is less than or equal to r. In this paper, we determine the clique number and geometric structures of maximum cliques of \hboxBilr(ℤhm× n). As a result, the Erdős-Ko-Rado theorem for ℤhm× n is obtained.