Counting core sets in matrix rings over finite fields
Abstract
Let R be a commutative ring and Mn(R) be the ring of n × n matrices with entries from R. For each S ⊂eq Mn(R), we consider its (generalized) null ideal N(S), which is the set of all polynomials f with coefficients from Mn(R) with the property that f(A) = 0 for all A ∈ S. The set S is said to be core if N(S) is a two-sided ideal of Mn(R)[x]. It is not known how common core sets are among all subsets of Mn(R). We study this problem for 2 × 2 matrices over Fq, where Fq is the finite field with q elements. We provide exact counts for the number of core subsets of each similarity class of M2(Fq). While not every subset of M2(Fq) is core, we prove that as q ∞, the probability that a subset of M2(Fq) is core approaches 1. Thus, asymptotically in~q, almost all subsets of M2(Fq) are core.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.