Erd\H{o}s-Ko-Rado theorem and bilinear forms graphs for matrices over residue class rings
Jun Guo

TL;DR
This paper extends the Erdős-Ko-Rado theorem to matrices over residue class rings by analyzing the structure of bilinear forms graphs and determining maximum cliques.
Contribution
It introduces a generalized bilinear forms graph over residue class rings and characterizes its maximum cliques, leading to an Erdős-Ko-Rado type theorem in this setting.
Findings
Determined the clique number of the bilinear forms graph over residue class rings.
Characterized the geometric structure of maximum cliques.
Established an Erdős-Ko-Rado theorem for matrices over residue class rings.
Abstract
Let be its decomposition into a product of powers of distinct primes, and be the residue class ring modulo . Let and be the set of all matrices over . The generalized bilinear forms graph over , denoted by , has the vertex set , and two distinct vertices and are adjacent if the inner rank of is less than or equal to . In this paper, we determine the clique number and geometric structures of maximum cliques of . As a result, the Erd\H{o}s-Ko-Rado theorem for is obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Coding theory and cryptography
