2021/10/19 by M. Hasan Meisami, Meisami, M., Ali Rejali +3
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Functional Analysis (math.FA) #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2110.10203
openalex publication_date 2021/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we define countable-configuration of groups and prove that two Hopfian groups with the same set of countable-configurations are isomorphic and vice versa. We also study the countable paradoxical decomposition of groups. It is proved that a group G admits a countable paradoxical decomposition if and only if it is infinite.