Abstract
A class of groups is said to be countably recognizable if a group belongs to whenever all its countable subgroups lie in . It is proved here that the class of minimax groups is countably recognizable.
Similar content being viewed by others
References
Baer, R.: Abzählbar erkennbare gruppentheoretische Eigenschaften. Math. Z. 79, 344–363 (1962)
Baer, R.: Polyminimaxgruppen. Math. Ann. 175, 1–43 (1968)
Dixon, M.R., Evans, M.J., Smith, H.: Some countably recognizable classes of groups. J. Group Theory 10, 641–653 (2007)
de Giovanni F., Trombetti M.: Countably recognizable classes of groups with restricted conjugacy classes. Int. J. Group Theory (to appear)
de Giovanni F., Trombetti M.: Countable recognizability and nilpotency properties of groups. Rend. Circ. Mat. Palermo. (2016). doi:10.1007/s12215-016-0261-y
Higman, G.: Almost free groups. Proc. Lond. Math. Soc. 1, 284–290 (1951)
Obraztsov, V.N.: An embedding theorem for groups and its corollaries. Math. USSR Sb. 66, 541–553 (1990)
Phillips, R.E.: \(f\)-Systems in infinite groups. Arch. Math. (Basel) 20, 345–355 (1969)
Phillips, R.E.: Countably recognizable classes of groups. Rocky Mt. J. Math. 1, 489–497 (1971)
Robinson, D.J.S.: Finiteness conditions and generalized soluble groups. Springer, Berlin (1972)
Smith, H.: More countably recognizable classes of groups. J. Pure Appl. Algebra 213, 1320–1324 (2009)
Zaicev, D.I.: Groups which satisfy a weak minimality condition. Dokl. Akad. Nauk SSSR 178, 780–782 (1968)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. S. Wilson.
The authors are members of GNSAGA (INdAM), and work within the A\(_{\textstyle \mathrm{D}}\)V\(-{\textsc {AGTA}}\) project.
Rights and permissions
About this article
Cite this article
de Giovanni, F., Trombetti, M. The class of minimax groups is countably recognizable. Monatsh Math 185, 81–86 (2018). https://doi.org/10.1007/s00605-016-0978-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-016-0978-x