Search arXivSearch

arXiv · 2603.12295

Periodic Points of Power Maps in Finite Matrix Groups and Algebras

Abstract

Consider the power map $x\mapsto x^L$ for a prime $L\neq 2$ such that $L|q-1$ where $q$ is a power of a prime. We determine the periodic points under this map for $\operatorname{M}_n(q)$, the algebra of $n\times n $ matrices over a finite field of order $q$, and also for the group $\operatorname{GL}_n(q)=\operatorname{M}_n(q)^\times$. We compute the limit $ \lim\limits_{\substack{q\longrightarrow \infty\\v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{M}_\ell(q))\right|}{|\operatorname{M}_\ell(q)|}$ and consequently $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{GL}_\ell(q))\right|}{|\operatorname{GL}_\ell(q)|}$, where $v_L$ denotes the $L$-adic valuation. We also compute the quantity $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{Sp}_{2\ell}(q))\right|}{|\operatorname{Sp}_{2\ell}(q)|}$ and $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{U}_\ell(q))\right|}{|\operatorname{U}_\ell(q)|}$; turns out these two limiting values are same. In all the cases, it turns out that the regular semisimple elements play the role in determining the limiting values.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saikat Panja. 2026-03-11. Periodic Points of Power Maps in Finite Matrix Groups and Algebras. https://arxiv.org/abs/2603.12295

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