Knapsack in hyperbolic groups
Markus Lohrey

TL;DR
This paper precisely characterizes the computational complexity of the knapsack problem in hyperbolic groups, showing it is in LogCFL and providing semilinear representations of solutions, extending to certain group classes.
Contribution
It determines the exact complexity class of the knapsack problem for hyperbolic groups and introduces the concept of knapsack-tame groups with polynomial-size semilinear solutions.
Findings
Knapsack problem in hyperbolic groups is LogCFL-complete if the group contains a free subgroup of rank two.
The set of solutions forms a semilinear set with polynomial-size representations.
Knapsack problem remains in LogCFL for groups formed by free and direct products with hyperbolic groups.
Abstract
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group is the following decision problem: given a tuple of elements of , are there natural numbers such that holds in ? Myasnikov, Nikolaev, and Ushakov proved that for every (Gromov-)hyperbolic group, the knapsack problem can be solved in polynomial time. In this paper, the precise complexity of the knapsack problem for hyperbolic group is determined: for every hyperbolic group , the knapsack problem belongs to the complexity class , and it is -complete if contains a free group of rank two. Moreover, it is shown that for every hyperbolic group and every tuple of…
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.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Computational Geometry and Mesh Generation
