English

Distribution of determinant of sum of matrices

Combinatorics 2019-04-17 v1 Number Theory

Abstract

Let Fq\mathbb{F}_q be an arbitrary finite field of order qq. In this article, we study detS\det S for certain types of subsets SS in the ring M2(Fq)M_2(\mathbb F_q) of 2×22\times 2 matrices with entries in Fq\mathbb F_q. For iFqi\in \mathbb{F}_q, let DiD_i be the subset of M2(Fq)M_2(\mathbb F_q) defined by Di:={xM2(Fq):det(x)=i}. D_i := \{x\in M_2(\mathbb F_q): \det(x)=i\}. Then our results can be stated as follows. First of all, we show that when EE and FF are subsets of DiD_i and DjD_j for some i,jFqi, j\in \mathbb{F}_q^*, respectively, we have det(E+F)=Fq,\det(E+F)=\mathbb F_q, whenever EF152q4|E||F|\ge {15}^2q^4, 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 (EDi)+(FDj),(E\cap D_i) + (F\cap D_j), when E,FE, F are subsets of the product type, i.e., U1×U2Fq2×Fq2U_1\times U_2\subseteq \mathbb F_q^2\times \mathbb F_q^2 under the identification M2(Fq)=Fq2×Fq2 M_2(\mathbb F_q)=\mathbb F_q^2\times \mathbb F_q^2. Lastly, as an extended version of the first result, we prove that if EE is a set in DiD_i for i0i\ne 0 and kk is large enough, then we have det(2kE):=det(E++E2k terms)Fq,\det(2kE):=\det(\underbrace{E + \dots + E}_{2k~terms})\supseteq \mathbb{F}_q^*, whenever the size of EE is close to q32q^{\frac{3}{2}}. Moreover, we show that, in general, the threshold q32q^{\frac{3}{2}} is best possible. Our main method is based on the discrete Fourier analysis.

Keywords

Cite

@article{arxiv.1904.07847,
  title  = {Distribution of determinant of sum of matrices},
  author = {Daewoong Cheong and Doowon Koh and Thang Pham and Anh Vinh Le},
  journal= {arXiv preprint arXiv:1904.07847},
  year   = {2019}
}