arXiv (All)
open access
An observation on factorizations of finite groups
Given a finite group $G$ and a factorization of its order, $|G|= a_1 a_2,$ we show that a sufficient condition for there to exist subsets $A_1,\,A_2\subseteq G$ such that $|A_1| = a_1,$ $|A_2| = a_2,$ and $G = A_1\,A_2,$ is that there exist a chain of subgroups $\{e\} = G_0 < \dots < G_n = G$ such t
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
- A finitely related group with an isomorphic proper factor group#490074
- Powerfully embedded subgroups of extensions of powerful pro-$p$ groups and its applications to automorphisms of finite groups#927122
- Finite Soluble Groups Need Not Admit Increasing Unrefinable Subgroup Chains#1062128
- A classification of finite simply reducible groups of order at most 2000#1123597
- Mixed identities in linear groups -- effective version#1036584
Record · ID 974526
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