Distribution of determinant of sum of matrices
Abstract
Let Fq be an arbitrary finite field of order q. In this article, we study S for certain types of subsets S in the ring M2( Fq) of 2× 2 matrices with entries in Fq. For i∈ Fq, let Di be the subset of M2( Fq) defined by Di := \x∈ M2( Fq): (x)=i\. Then our results can be stated as follows. First of all, we show that when E and F are subsets of Di and Dj for some i, j∈ Fq*, respectively, we have (E+F)= Fq, whenever |E||F| 152q4, and then provide a concrete construction to show that our result is sharp. Next, as an application of the first result, we investigate a distribution of the determinants generated by the sum set (E Di) + (F Dj), when E, F are subsets of the product type, i.e., U1× U2⊂eq Fq2× Fq2 under the identification M2( Fq)= Fq2× Fq2. Lastly, as an extended version of the first result, we prove that if E is a set in Di for i 0 and k is large enough, then we have \[(2kE):=(E + … + E2k~terms)⊃eq Fq*,\] whenever the size of E is close to q32. Moreover, we show that, in general, the threshold q32 is best possible. Our main method is based on the discrete Fourier analysis.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.