Open Research Index

A Surjunctive Group That Is Not Sofic

Sauers

Palomar Registrypalomar/PALOMAR-2026-09-14-000002Sep 14, 2026math.GRscore 0

We formalize the existence of a finitely generated surjunctive group that is not sofic. This answers negatively the converse to the Gromov-Weiss surjunctivity theorem, recorded as open problem OP-11 by Ceccherini-Silberstein and Coornaert and as Problem 1.1 by Bowen and Chapman. The witness is the symmetric double G *_Gamma G, where Gamma = EL_3(F_2[x_1,x_2,x_3]) and G = EL_3(F_2[x_1^+-1,x_2^+-1,x_3^+-1]) semidirect EL_3(Z), with the action given by monomial substitution. Kun and Thom constructed this pair and proved the double nonsofic. The new ingredient here is a surjunctivity theorem for…

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-09-14-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-14-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-14-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'