Our main result is a characterization of those wreath products G ≀ H for which the knapsack problem is decidable. The characterization is in terms of ...
Jan 15, 2021 · The characterization is in terms of decidability properties of the indiviual factors G and H. To this end, we introduce two decision problems, ...
The characterization is in terms of decidability properties of the indiviual factors G and H. To this end, we introduce two decision problems, the intersection ...
We study the knapsack problem for wreath products G≀H of groups G and H. Our main result is a characterization of those wreath products G≀H for which the ...
Jan 15, 2021 · Since KP(H3(Z) × Zℓ) is decidable for any ℓ ≥ 0 [8, Theorem 6.8], this implies that wreath products do not preserve decidability of knapsack ...
The characterization is in terms of decidability properties of the indiviual factors $G$ and $H$. To this end, we introduce two decision problems, the ...
The main result is a characterization of those wreath products G ≀ H for which the knapsack problem is decidable, in terms of decidability properties of the ...
Our main result is a characterization of those wreath products G≀H for which the knapsack problem is decidable. The characterization is in terms of ...
Jan 15, 2021 · KP(G≀H3(Z)) is decidable. Using Theorem 3.1, this can be settled. ▷Theorem 3.3. For every non-trivial G, the problem KP(G≀H3(Z)) is undecidable.
TL;DR: In this paper, it was shown that the knapsack problem is undecidable for wreath products of groups G and H if and only if solvability of systems of ...