Abstract
In this paper we show that all finitely generated nilpotent, metabelian, polycyclic, and rigid (hence free solvable) groups G are fully characterized in the class of all groups by the set tp(G) of types realized in G. Furthermore, it turns out that these groups G are fully characterized already by some particular rather restricted fragments of the types from tp(G). In particular, every finitely generated nilpotent group is completely defined by its ∃+-types, while a finitely generated rigid group is completely defined by its ∀-types, and a finitely generated metabelian or polycyclic group is completely defined by its ∀∃-types. We have similar results for some non-solvable groups: free, surface, and free Burnside groups, though they mostly serve as illustrations of general techniques or provide some counterexamples.
| Original language | English |
|---|---|
| Pages (from-to) | 1613-1632 |
| Number of pages | 20 |
| Journal | International Journal of Algebra and Computation |
| Volume | 28 |
| Issue number | 8 |
| DOIs | |
| State | Published - 1 Dec 2018 |
Keywords
- Group
- elementary embedding
- free
- metabelian
- nilpotent
- type
Fingerprint
Dive into the research topics of 'Characterization of finitely generated groups by types'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver