On subset sum problem in branch groups
arXiv:2006.03470 · doi:10.46298/jgcc.2020.12.1.6541
Abstract
We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly regular branch groups, which implies NP-completeness if the group is, in addition, contracting.
v3: final version for journal of Groups, Complexity, Cryptology. arXiv admin note: text overlap with arXiv:1703.07406