Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory
In plain wordsA finitely presented amenable group can have a finite piece that permutations imitate only with nearly exponentially many points; it yields an explicit quantum channel that, applied n times by a device releasing each output at once, needs memory times purity of about n.
The result
As the paper states it, in briefA finitely presented elementary amenable group with a finite piece whose sofic profile is .
Questionson the index
How this was checked
- Machine checks
- Five finite checks in the repository; they are not formal verification.
- Lean
- None.
- Peer review
- Not yet.
Every check here is internal. How we check results.
Novelty and credit
- Novelty
- New, with named precedent: Musat and Rørdam gave channels in the closure with no finite tracial factorization, and Slofstra a finitely presented group with profile at least exp(rc) that is not known to be sofic. It extends the authors’ Houghton paper. New, in the paper’s words: the quantitative profile, with exponent 1 − o(1).
Versionsseven, each with its own DOI
| Version | Date | DOI | Notes |
|---|---|---|---|
| 1.2.0 | 10.5281/zenodo.23875973 | Adds a sweep form of the counting criterion; for the dyadic lamplighter of Section 8.1 the lower bound rises from exp(c r1/3) to exp(c r1/2). The discussion of Thompson’s groups cites the recent soficity preprint of Chaudkhari, Juschenko and Muliarchyk (arXiv:2610.25415), on which the soficity of the subgroup L relies. PDF hosted here. | |
| 1.1.2 | 10.5281/zenodo.23111927 | Correction: Credit added in the introduction: Gromov and Weiss; OpenAI’s announcement, Fournier-Facio, and Kun and Thom on non-sofic groups; Slofstra and Vidick, and Slofstra; Arzhantseva and Cherix; and work on channel simulation, memory costs and collision models. | |
| 1.1.1 | 10.5281/zenodo.23108312 | Correction: Precision: a step in an appendix’s Choi-rank count is corrected (the bound is unchanged), and a set of coefficients is corrected from {±1, ±2^−1/2} to {1, ±2^−1/2}. | |
| 1.1.0 | 10.5281/zenodo.23107117 | ||
| 1.0.2 | 10.5281/zenodo.23070871 | Correction: Credit made precise: Cornulier’s dichotomy and his facts on local embeddability, Lee’s Dehn function, Johnson’s presentation, and Brown, Brin, and Hennig and Matucci for finite presentation are cited where they are used, as are the lemmas taken from the companion papers. | |
| 1.0.1 | 10.5281/zenodo.23065778 | ||
| 1.0.0 | 10.5281/zenodo.23050303 |
Paper, code and links
papers/configuration-lamps-v1.2.0.pdf, version 1.2.0, 1,321,935 bytes, 78 pages.SHA-256 08f6116f2d089eced411b84932615492038e0b63760554ebd1813a94a0bbced0
- DOI
10.5281/zenodo.23875973; all versions 10.5281/zenodo.23050302
- arXiv
Corrections
- Version 1.1.2. Credit added in the introduction: Gromov and Weiss; OpenAI’s announcement, Fournier-Facio, and Kun and Thom on non-sofic groups; Slofstra and Vidick, and Slofstra; Arzhantseva and Cherix; and work on channel simulation, memory costs and collision models.doi:10.5281/zenodo.23111927
- Version 1.1.1. Precision: a step in an appendix’s Choi-rank count is corrected (the bound is unchanged), and a set of coefficients is corrected from {±1, ±2−1/2} to {1, ±2−1/2}.doi:10.5281/zenodo.23108312
- Version 1.0.2. Credit made precise: Cornulier’s dichotomy and his facts on local embeddability, Lee’s Dehn function, Johnson’s presentation, and Brown, Brin, and Hennig and Matucci for finite presentation are cited where they are used, as are the lemmas taken from the companion papers.doi:10.5281/zenodo.23070871
All corrections, and what counts as one.
Cite
@misc{douglas2026configurationlamps,
author = {Douglas, Seth and Mghirbi, Nidhal},
title = {Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory},
year = {2026},
version = {1.2.0},
doi = {10.5281/zenodo.23875973},
url = {https://doi.org/10.5281/zenodo.23875973},
eprint = {2610.04271},
archiveprefix = {arXiv}
}