Distribution of the determinants of sums of matrices

From MaRDI portal
Publication:2039473

DOI10.4171/RMI/1230zbMATH Open1477.11202arXiv1904.07847OpenAlexW3097084573MaRDI QIDQ2039473FDOQ2039473


Authors: Daewoong Cheong, Doowon Koh, Le Anh Vinh, Pham Van Thang Edit this on Wikidata


Publication date: 5 July 2021

Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)

Abstract: Let mathbbFq be an arbitrary finite field of order q. In this article, we study detS for certain types of subsets S in the ring M2(mathbbFq) of 2imes2 matrices with entries in mathbbFq. For iinmathbbFq, let Di be the subset of M2(mathbbFq) defined by Di:=xinM2(mathbbFq):det(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,jinmathbbFq, respectively, we have det(E+F)=mathbb F_q, whenever |E||F|ge152q4, 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 (EcapDi)+(FcapDj), when E,F are subsets of the product type, i.e., U1imesU2subseteqmathbbFq2imesmathbbFq2 under the identification M2(mathbbFq)=mathbbFq2imesmathbbFq2. Lastly, as an extended version of the first result, we prove that if E is a set in Di for ie0 and k is large enough, then we have [det(2kE):=det(underbrace{E + dots + E}_{2k~terms})supseteq mathbb{F}_q^*,] whenever the size of E is close to qfrac32. Moreover, we show that, in general, the threshold qfrac32 is best possible. Our main method is based on the discrete Fourier analysis.


Full work available at URL: https://arxiv.org/abs/1904.07847




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Distribution of the determinants of sums of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039473)