On Distinct Powers in Finite Groups

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-10
DOI
https://doi.org/10.48550/arxiv.2611.13582
Primary Topic
Finite Group Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On Distinct Powers in Finite Groups

Dingying Ma
arXiv (Cornell University)
Finite Group Theory Research
preprint

On Distinct Powers in Finite Groups

Dingying Ma
preprint en

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.

arXiv (Cornell University)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon