Some sum-product estimates in matrix rings over finite fields
نویسندگان
چکیده
We study some sum-product problems over matrix rings. Firstly, for A , B C ? M n ( F q ) we have | + ? 2 whenever 3 ? 1 . Secondly, if a set in satisfies ? sufficiently large then max ? { } min 4 / These improve the results due to The and Vinh (2020), generalize Mohammadi, Pham, Wang (2021). also give new proof recent result (2020). Our method is based on spectral graph theory linear algebra.
منابع مشابه
New Sum-product Type Estimates over Finite Fields
Let F be a field with positive odd characteristic p. We prove a variety of new sum-product type estimates over F . They are derived from the theorem that the number of incidences between m points and n planes in the projective three-space PG(3, F ), with m ≥ n = O(p), is O(m √ n+ km), where k denotes the maximum number of collinear planes. The main result is a significant improvement of the sta...
متن کاملSum-product Estimates in Finite Fields via Kloosterman Sums
We establish improved sum-product bounds in finite fields using incidence theorems based on bounds for classical Kloosterman and related sums.
متن کاملMatrix product codes over finite commutative Frobenius rings
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.
متن کاملSum and Shifted-Product Subsets of Product-Sets over Finite Rings
For sufficiently large subsets A,B, C,D of Fq, Gyarmati and Sárközy (2008) showed the solvability of the equations a+b = cd and ab+1 = cd with a ∈ A, b ∈ B, c ∈ C, d ∈ D. They asked whether one can extend these results to every k ∈ N in the following way: for large subsets A,B, C,D of Fq, there are a1, . . . , ak, a1, . . . , ak ∈ A, b1, . . . , bk, b ′ 1, . . . , b ′ k ∈ B with ai + bj , aibj ...
متن کاملGenerating Optimized Sparse Matrix Vector Product over Finite Fields
Sparse Matrix Vector multiplication (SpMV) is one of the most important operation for exact sparse linear algebra. A lot of research has been done by the numerical community to provide efficient sparse matrix formats. However, when computing over finite fields, one need to deal with multi-precision values and more complex operations. In order to provide highly efficient SpMV kernel over finite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.101997