Abstract
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group G is the following decision problem: given a tuple \((g, g_1, \ldots , g_k)\) of elements of G, are there natural numbers \(n_1, \ldots , n_k \in \mathbb {N}\) such that \(g = g_1^{n_1} \cdots g_k^{n_k}\) holds in G? Myasnikov, Nikolaev, and Ushakov proved that for every hyperbolic group, the knapsack problem can be solved in polynomial time. In this paper, it is shown that for every hyperbolic group G, the knapsack problem belongs to the complexity class \(\mathsf {LogCFL}\), and it is \(\mathsf {LogCFL}\)-complete if G contains a free group of rank two. Moreover, it is shown that for every hyperbolic group G and every tuple \((g, g_1, \ldots , g_k)\) of elements of G the set of all \((n_1, \ldots , n_k) \in \mathbb {N}^k\) such that \(g = g_1^{n_1} \cdots g_k^{n_k}\) in G is effectively semilinear.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1–36 (1998)
Elberfeld, M., Jakoby, A., Tantau, T.: Algorithmic meta theorems for circuit classes of constant and logarithmic depth. Electron. Colloq. Comput. Complex. (ECCC) 18, 128 (2011)
Epstein, D.B.A., Holt, D.F.: The linearity of the conjugacy problem in word-hyperbolic groups. Int. J. Algebra Comput. 16(2), 287–306 (2006)
Frenkel, E., Nikolaev, A., Ushakov, A.: Knapsack problems in products of groups. J. Symb. Comput. 74, 96–108 (2016)
Ganardi, M., König, D., Lohrey, M., Zetzsche, G.: Knapsack problems for wreath products. In: Proceedings of STACS 2018. LIPIcs, vol. 96, pp. 32:1–32:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
Ghys, E., de La Harpe, P.: Sur les groupes hyperboliques d’après Mikhael Gromov. Progress in mathematics. Birkhäuser, Basel (1990)
Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285–296 (1966)
Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. MSRI, vol. 8, pp. 75–263. Springer, New York (1987). https://doi.org/10.1007/978-1-4613-9586-7_3
Haase, C.: On the complexity of model checking counter automata. Ph.D. thesis, University of Oxford, St Catherine’s College (2011)
Holt, D.F.: Word-hyperbolic groups have real-time word problem. Int. J. Algebra Comput. 10, 221–228 (2000)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
König, D., Lohrey, M., Zetzsche, G.: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. In: Algebra and Computer Science. Contemporary Mathematics, vol. 677, pp. 138–153. American Mathematical Society (2016)
Kopczynski, E., To, A.W.: Parikh images of grammars: complexity and applications. In: Proceedings of LICS 2010, pp. 80–89. IEEE Computer Society (2010)
Lehnert, J., Schweitzer, P.: The co-word problem for the Higman-Thompson group is context-free. Bull. Lond. Math. Soc. 39(2), 235–241 (2007)
Lohrey, M.: Decidability and complexity in automatic monoids. Int. J. Found. Comput. Sci. 16(4), 707–722 (2005)
Lohrey, M., Zetzsche, G.: Knapsack in graph groups, HNN-extensions and amalgamated products. CoRR, abs/1509.05957 (2015)
Lohrey, M.: Knapsack in hyperbolic groups. CoRR, abs/1807.06774 (2018). https://arxiv.org/abs/1807.06774
Lohrey, M., Zetzsche, G.: Knapsack in graph groups, HNN-extensions and amalgamated products. In: Proceedings of STACS 2016. LIPIcs, vol. 47, pp. 50:1–50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
Lohrey, M., Zetzsche, G.: Knapsack in graph groups. Theory Comput. Syst. 62(1), 192–246 (2018)
Mishchenko, A., Treier, A.: Knapsack problem for nilpotent groups. Groups Complex. Cryptol. 9(1), 87–98 (2017)
Myasnikov, A., Nikolaev, A.: Verbal subgroups of hyperbolic groups have infinite width. J. Lond. Math. Soc. 90(2), 573–591 (2014)
Myasnikov, A., Nikolaev, A., Ushakov, A.: Knapsack problems in groups. Math. Comput. 84, 987–1016 (2015)
Ol’shanskii, A.Yu.: Almost every group is hyperbolic. Int. J. Algebra Comput. 2(1), 1–17 (1992)
Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25(3), 405–414 (1978)
To, A.W.: Parikh images of regular languages: complexity and applications. CoRR, abs/1002.1464 (2010). http://arxiv.org/abs/1002.1464
Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-662-03927-4
Acknowledgement
This work has been supported by the DFG research project LO 748/13-1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Lohrey, M. (2018). Knapsack in Hyperbolic Groups. In: Potapov, I., Reynier, PA. (eds) Reachability Problems. RP 2018. Lecture Notes in Computer Science(), vol 11123. Springer, Cham. https://doi.org/10.1007/978-3-030-00250-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-00250-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00249-7
Online ISBN: 978-3-030-00250-3
eBook Packages: Computer ScienceComputer Science (R0)