A characterization of wreath products where knapsack is decidable
Pascal Bergstr\"a{\ss}er, Moses Ganardi, Georg Zetzsche

TL;DR
This paper characterizes when the knapsack problem is decidable for wreath products of groups, linking it to the decidability properties of the individual factors, and applies this to specific groups like the Heisenberg and Baumslag-Solitar groups.
Contribution
It provides a complete characterization of decidability of the knapsack problem for wreath products based on properties of the factors, introducing new decision problems.
Findings
Knapsack problem undecidable for G wreath H_3(Z) if G ≠ 1.
Decidability for G wreath BS(1,q) depends on exponent equations in G.
Decidability for G wreath H depends on H being virtually abelian and G's exponent system solvability.
Abstract
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group and takes as input group elements and asks whether there are with . We study the knapsack problem for wreath products of groups and . Our main result is a characterization of those wreath products for which the knapsack problem is decidable. The characterization is in terms of decidability properties of the indiviual factors and . To this end, we introduce two decision problems, the intersection knapsack problem and its restriction, the positive intersection knapsack problem. Moreover, we apply our main result to , the discrete Heisenberg group, and to Baumslag-Solitar groups for . First, we show that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
