PreprintCC BYarXiv (Cornell University)
Nonsofic wreath products of residually finite groups
Abstract
This work builds on the breakthrough of OpenAI in finding the first nonsofic group. We analyze the underlying proof mechanism and find further applications. Let $Γ
Related
- Representation zeta functions of wreath products with finite groups
- Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
- Standard bases for shift-stable groups and Subgroup Membership in wreath products
- On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups
- The Diophantine Problem in Wreath Products of Groups
BibTeX
@misc{kun2026nonsofic,
title = {{Nonsofic wreath products of residually finite groups}},
author = {Gábor Kun and Andreas Thom},
howpublished = {arXiv (Cornell University)},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.06222},
url = {https://arxiv.org/abs/2608.06222},
note = {CC BY},
}
RIS
TY - UNPB
TI - Nonsofic wreath products of residually finite groups
AU - Gábor Kun
AU - Andreas Thom
PY - 2026
DA - 2026/08/06
PB - arXiv (Cornell University)
DO - 10.48550/arxiv.2608.06222
UR - https://arxiv.org/abs/2608.06222
AB - This work builds on the breakthrough of OpenAI in finding the first nonsofic group. We analyze the underlying proof mechanism and find further applications. Let $Γ
SN - 2331-8422
ER -