On minimal non-sofic and $\omega$-non-sofic groups
K{\i}van\c{c} Ersoy

TL;DR
This paper explores the structural properties of hypothetical non-sofic groups, introducing classes like minimal non-sofic and $oldsymbol{oldsymbol{oldsymbol{oldsymbol{ ext{omega}}}}}$-non-sofic groups, and establishing their key characteristics and implications.
Contribution
It defines and analyzes minimal non-sofic and $oldsymbol{oldsymbol{oldsymbol{oldsymbol{ ext{omega}}}}}$-non-sofic groups, revealing their structural restrictions and implications for the existence of non-sofic groups.
Findings
Minimal non-sofic groups have a central finitely generated residually finite maximal normal subgroup.
Locally graded non-sofic groups are necessarily $oldsymbol{oldsymbol{oldsymbol{oldsymbol{ ext{omega}}}}}$-non-sofic.
Existence of a non-sofic group implies existence of a countable existentially closed non-sofic group with a densely ordered chain of centralizers.
Abstract
We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and -non-sofic groups. For minimal non-sofic groups, we establish strong structural restrictions. In particular, we show that if is a minimal non-sofic group and is a finitely generated residually finite maximal normal subgroup of , then is central and is a perfect central extension of a finitely generated non-amenable simple group. On the other hand, we show that locally graded non-sofic groups are necessarily -non-sofic. More precisely, such groups contain finitely generated non-sofic subgroups admitting strictly decreasing chains of finitely generated normal subgroups whose intersection is nontrivial and lies in the profinite residual. Finally, using results on existentially closed groups, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
