Embedding theorems for solvable groups
Vitaly Roman'kov

TL;DR
This paper proves that finitely generated solvable groups can be embedded into small generating groups with controlled properties, providing new insights into group embeddings and answering longstanding questions.
Contribution
It establishes that finitely generated solvable groups can be embedded into 4-generated solvable groups, and countable groups with free abelianization into 2-generated groups, advancing embedding theory.
Findings
Finitely generated groups in a variety can be embedded into 4-generated groups within the same variety.
Finite solvable groups can be embedded into finite 4-generated solvable groups of derived length increased by one.
Countable groups with free abelianization can be embedded into 2-generated groups within the same variety.
Abstract
In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group lying in a variety can be embedded in a -generated group ( means the variety of abelian groups). If is a finite group, then can also be found as a finite group. It follows, that any finitely generated (finite) solvable group of the derived length can be embedded in a -generated (finite) solvable group of length . Thus, we answer the question of V. H. Mikaelian and A.Yu. Olshanskii. It is also shown that any countable group , such that the abelianization is a free abelian group, is embeddable in a -generated group .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Mathematics and Applications
