2024/04/24 by Pratulananda Das, Ayan Ghosh, Das, Pratulananda +1
Computer Science · Mathematics · #Coding theory and cryptography #FOS: Mathematics #General Topology (math.GN) #Group Theory (math.GR) #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2404.15905
openalex publication_date 2024/04/24 · openalex created_date 2024/04/26 · openalex updated_date 2026/07/28
Recently, in Das et al. (Mediterr. J. Math. 21 : 164, 2024), characterized subgroups are investigated for some special kind of non-arithmetic sequences. In this note, we study subsequent problems in case of ``statistically characterized subgroups" introduced in Dikranjan et al. (Fund. Math. 249 : 185-209, 2020). The entire investigation emphasizes that these statistically characterized subgroups are mostly larger in size, having cardinality \mathfrakc, and exhibit behavior that significantly differs from that of classically characterized subgroups. As a consequence, we solve an open problem raised in Dikranjan et al. (Fund. Math. 249 : 185-209, 2020).