Knapsack in graph groups, HNN-extensions and amalgamated products

DOI10.4230/LIPICS.STACS.2016.50zbMATH Open1380.68229arXiv1509.05957MaRDI QIDQ4601902FDOQ4601902

Authors: Markus Lohrey, Georg Zetzsche 

Publication date: 24 January 2018

Abstract: It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form by SLPs, which generalizes the classical NP-completeness result of the integer knapsack problem. We also prove general transfer results: NP-membership of the knapsack problem is passed on to finite extensions, HNN-extensions over finite associated subgroups, and amalgamated products with finite identified subgroups.

Full work available at URL: https://arxiv.org/abs/1509.05957

Recommendations

• Knapsack in graph groups
• The Complexity of Knapsack in Graph Groups
• Knapsack in hyperbolic groups
• Knapsack in hyperbolic groups
• Knapsack problems in groups

zbMATH Keywords

knapsackHNN-extensionsamalgamated productsgraph groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (12)

• Subset sum problem in polycyclic groups
• On subset sum problem in branch groups
• Closure properties of knapsack semilinear groups
• Knapsack problems in groups
• Knapsack in graph groups
• Knapsack problems in products of groups
• Knapsack and the power word problem in solvable Baumslag–Solitar groups
• Knapsack in hyperbolic groups
• Knapsack problems for wreath products
• The Complexity of Knapsack in Graph Groups
• Knapsack in hyperbolic groups
• Knapsack problem for nilpotent groups

This page was built for publication: Knapsack in graph groups, HNN-extensions and amalgamated products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601902)