arXiv (All)
open access
Finite groups with large power-avoiding subsets
A subset $X$ of a finite group $G$ is $k$-power-avoiding if for all $g\in G$ we have that $\{g,g^k\}\not\subseteq X$. The paper shows that if $G$ contains a $k$-power-avoiding subset $X$ with $|X|\geq |G|-c$, then the group $G^k$ generated by the $k$th powers of elements of $G$ has bounded order (in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
- On the Complexity of Forcing and Anti-Forcing Minimum Cuts#1118004
- Projection and fibering in groups of bounded exponent#1070529
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Rank properties of commutators in finite groups#1064853
Record · ID 1012694
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive