The word problem of the Brin-Thompson group is coNP-complete

J. C. Birget

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment