Searcharxiv⌕ Search

arXiv · 2610.23373

Finite power image families and automorphism actions in linear groups

Abstract

Let $k/\mathbb{Q}$ be a finitely generated field extension. We characterize the subgroups $G\leq GL_n(k)$ for which the power images $P_m(G)=\{g^m:g\in G\}$ form a finite family: this holds precisely when $G=N\rtimes F$, where $F$ is finite and $N$ is a uniquely divisible subgroup consisting of unipotent matrices. The subgroup $N$ is canonical and fully invariant.For $e=\exp(G/N)$, we obtain $P_m(G)=P_{\gcd(m,e)}(G)$, exactly $τ(e)$ distinct power images, and least positive period $e$, where $τ(e)$ is the number of positive divisors of $e$.Over $\mathbb{Q}$, the group coincides with the full group of rational points of its Zariski closure. Since finite automorphism-orbit count implies finiteness of the power-image family, an affirmative answer to Problem~21.40 of the Kourovka Notebook\cite{Kourovka} follows as a corollary. We further prove that a rational linear group $G$ admits a decomposition $G\cong(\mathbb{Q}^d,+)\rtimes F$, with $d\geq0$ finite and $F$ finite, whenever a virtually nilpotent subgroup of $\operatorname{Aut}(G)$ has finitely many orbits on $G$.The latter argument uses nonconstant invariant rational functions arising from nonzero Lie brackets to obstruct dense orbits. A metabelian action with five orbits on the rational Heisenberg group shows that solubility of the acting group is insufficient.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhexin Jiang. 2026-10-16. Finite power image families and automorphism actions in linear groups. https://arxiv.org/abs/2610.23373

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

KEEP EXPLORING

Related papers

Some questions related to free-by-cyclic groups and tubular groups

We prove that a CAT(0) free-by-cyclic tubular group with a single vertex is virtually special, but many of them cannot virtually act freely and cocompactly on CAT(0) cube complexes. This partially confirms a question of Brady--Soroko \cite[Section 9: Question 1]{BS} and answers a question of Lyman \cite[Question 1]{Ly} in the negative. Furthermore, we provide examples of free-by-cyclic groups amalgamated along cyclic subgroups that are not virtually free-by-cyclic. This answers negatively a question of Hagen--Wise \cite[Remark 3.6]{hw}. Lastly, we exhibit an example of a cyclic-subgroup-separable tubular group that does not have the property (VRC) (i.e. every cyclic subgroup is a virtual retract). This answers a question of Minasyan \cite[Question 11.6]{min} in the negative.

math.GR↗

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR↗

Soficity of One-Relator Groups and Reducible Presentations

We prove that every one-relator group is sofic, answering a question of Nate Brown. More generally, every group admitting a reducible presentation without proper powers is sofic, with one proper-power relation allowed at the final reducible step. The proof starts from the endpoint-preserving edge replacements of Poulin--Wróbel. We retain the free-group word carried by each terminal replacement and use it to define an \(F(S)\)-valued cocycle repair; in its relative form, the repair preserves the previously chosen generator coordinates while controlling the new relator defect. Coinduction transports the lower cocycle through successive one-relator-product extensions, allowing the construction to be iterated along reducible presentations. For a final relator \(w^m\), cyclic translates of the repaired set amplify a zero-defect set of measure close to \(1/m\) to one of measure close to one. A cocycle criterion then converts arbitrarily small relator defect into finite permutation approximations via a treeable skew-product orbit relation.

math.GR↗