Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 100 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Kimi K2 186 tok/s Pro
2000 character limit reached

SSGP topologies on abelian groups of positive finite divisible rank (1704.08554v2)

Published 27 Apr 2017 in math.GN and math.GR

Abstract: Let G be an abelian group. For a subset A of G, Cyc(A) denotes the set of all elements x of G such that the cyclic subgroup generated by x is contained in A, and G is said to have the small subgroup generating property (abbreviated to SSGP) if the smallest subgroup of G generated by Cyc(U) is dense in G for every neighbourhood U of zero of G. SSGP groups form a proper subclass of the class of minimally almost periodic groups. Comfort and Gould asked for a characterization of abelian groups G which admit an SSGP group topology, and they solved this problem for bounded torsion groups (which have divisible rank zero). Dikranjan and the first author proved that an abelian group of infinite divisible rank admits an SSGP group topology. In the remaining case of positive finite divisible rank, the same authors found a necessary condition on G in order to admit an SSGP group topology and asked if this condition is also sufficient. We answer this question positively, thereby completing the characterization of abelian groups which admit an SSGP group topology.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.