The word problem of the Brin-Thompson group is coNP-complete
Group Theory
2020-02-12 v2 Computational Complexity
Abstract
We prove that the word problem of the Brin-Thompson group nV over a finite generating set is coNP-complete for every n \ge 2. It is known that the groups nV are an infinite family of infinite, finitely presented, simple groups. We also prove that the word problem of the Thompson group V over a certain infinite set of generators, related to boolean circuits, is coNP-complete.
Keywords
Cite
@article{arxiv.1902.03852,
title = {The word problem of the Brin-Thompson group is coNP-complete},
author = {J. C. Birget},
journal= {arXiv preprint arXiv:1902.03852},
year = {2020}
}
Comments
38 pages