Searcharxiv⌕ Search

arXiv · 2611.13582

On Distinct Powers in Finite Groups

Abstract

Sun conjectured that if a group $G$ has no elements of orders $2,3,...,n+1$, then every $n$-element subset $A$ can be ordered as $a_1,...,a_n$ so that $a_1,a_2^2,...,a_n^n$ are pairwise distinct. We prove the conjecture for finite groups when $n=4,5,6$. The proofs combine collision-counting arguments with reductions to finite-field assignment problems; the remaining finite cases for $n=6$ are verified exhaustively. We also prove the conjecture for every $n$ when no four elements of $A$ generate the same cyclic subgroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dingying Ma. 2026-11-10. On Distinct Powers in Finite Groups. https://searcharxiv.com/abs/2611.13582

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗