Counting core sets in matrix rings over finite fields
Roswitha Rissner, Nicholas J. Werner

TL;DR
This paper investigates the frequency of core subsets within the matrix ring over finite fields, providing exact counts for small matrices and showing that almost all subsets are core as the field size grows.
Contribution
It offers the first explicit enumeration of core subsets in $M_2(F_q)$ and proves their prevalence asymptotically as the field size increases.
Findings
Exact counts for core subsets in each similarity class of $M_2(F_q)$
Not all subsets are core, but prevalence approaches 1 as $q o
Almost all subsets are core in large finite fields.
Abstract
Let be a commutative ring and be the ring of matrices with entries from . For each , we consider its (generalized) null ideal , which is the set of all polynomials with coefficients from with the property that for all . The set is said to be core if is a two-sided ideal of . It is not known how common core sets are among all subsets of . We study this problem for matrices over , where is the finite field with elements. We provide exact counts for the number of core subsets of each similarity class of . While not every subset of is core, we prove that as , the probability that a subset of is core approaches 1. Thus, asymptotically in~, almost all…
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Graph Labeling and Dimension Problems
