We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$ satisfies $|A|\geq C(n)q^{n^2-1}$ for some sufficiently large $C(n)$, then we have $$ \max\{|A+A|, |AA|\}\gtrsim \min\left\{\frac{|A|^2}{q^{n^2-\frac{n+1}{4}}}, q^{n^2/3}|A|^{2/3}\right\}. $$ These improve the results due to The and Vinh (2020), and generalize the results due to Mohammadi, Pham, and Wang (2021). We also give a new proof for a recent result due to The and Vinh (2020). Our method is based on spectral graph theory and linear algebra.Comment: 18 page
A variation on the sum-product problem seeks to show that a set which is defined by additive and mul...
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
Let A and B be two finite sets of numbers. The sum set and the product set of A, B are A + B = {a ...
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimo...
In our paper, we introduce a new method for estimating incidences via representation theory. We obta...
Let Fp be the finite field of a prime order p. Let F: Fp x Fp --> Fp be a function defined by F(x, y...
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$,...
Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate...
In this paper, we count the number of matrices $A = (A_{i,j} )\in \mathcal{O} \subset Mat_{n\times n...
AbstractWe study a Szemerédi–Trotter type theorem in finite fields. We then use this theorem to obta...
We give optimal bounds for matrix Kloosterman sums modulo prime powers extending earlier work of the...
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, de...
We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to sm...
This is a survey on sum-product formulae and methods. We state old and new results. Our main objecti...
The sum-product problem of Erdos and Szemeredi asserts that any subset of the integers has many prod...
A variation on the sum-product problem seeks to show that a set which is defined by additive and mul...
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
Let A and B be two finite sets of numbers. The sum set and the product set of A, B are A + B = {a ...
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimo...
In our paper, we introduce a new method for estimating incidences via representation theory. We obta...
Let Fp be the finite field of a prime order p. Let F: Fp x Fp --> Fp be a function defined by F(x, y...
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$,...
Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate...
In this paper, we count the number of matrices $A = (A_{i,j} )\in \mathcal{O} \subset Mat_{n\times n...
AbstractWe study a Szemerédi–Trotter type theorem in finite fields. We then use this theorem to obta...
We give optimal bounds for matrix Kloosterman sums modulo prime powers extending earlier work of the...
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, de...
We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to sm...
This is a survey on sum-product formulae and methods. We state old and new results. Our main objecti...
The sum-product problem of Erdos and Szemeredi asserts that any subset of the integers has many prod...
A variation on the sum-product problem seeks to show that a set which is defined by additive and mul...
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
Let A and B be two finite sets of numbers. The sum set and the product set of A, B are A + B = {a ...