Search arXivSearch

arXiv · 2607.23275

Matrix Kloosterman sums and product-trace estimates for semisimple algebras

Abstract

Let $k=\mathbb{F}_q$, $E=\mathbb{F}_{q^n}$ and $\mathrm{Tr}=\mathrm{Tr}_{E/k}$. For $r\ge 2$, $a\in k^{\times}$ and $x\in E^{\times}$, let $\mathrm{N}(E,r,x,a)$ be the number of $r$-tuples $(x_1,\cdots,x_r)$ in $(E^{\times})^r$ satisfying $x_1\cdots x_r=x$ and $\mathrm{Tr}(x_1+\cdots+x_r)=a$. We prove $\left|\mathrm{N}(E,r,x,a)-\left((q^n-1)^{r-1}+(-1)^r\right)/q\right|\le (r^n-1) q^{\frac{(r-1)n-1}{2}}$. This proves the square-root estimate predicted in Wan's conjecture and generalizes a previous result of Moisio and Wan. For a finite semisimple algebra $B=\prod\limits_{i=1}^s M_{d_i}(\mathbb{F}_{q^{n_i}})$ over $k$ and a regular element $x\in B^{\times}$, the same method combined with Zelingher's formula leads to analogous square-root estimates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuejun Guo, Chen Lin, Chenhao Tang. 2026-07-25. Matrix Kloosterman sums and product-trace estimates for semisimple algebras. https://arxiv.org/abs/2607.23275

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT