Author:
Mishchenko Alexei,Treier Alexander
Abstract
AbstractIn this work we investigate the group version of the well known knapsack problem in the class of nilpotent groups. The main result of this paper is that the knapsack problem is undecidable for any torsion-free group of nilpotency class 2 if the rank of the derived subgroup is at least 316. Also, we extend our result to certain classes of polycyclic groups, linear groups, and nilpotent groups of nilpotency class greater than or equal to 2.
Funder
Russian Science Foundation
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference18 articles.
1. Knapsack problems in groups;Math. Comp.,2015
2. Zur Theorie der quadratischen Formen;Nachr. Akad. Wiss. Göttingen Math.-Phys. KL II,1972
3. Zur Theorie der quadratischen Formen;Nachr. Akad. Wiss. Göttingen Math.-Phys. KL II,1972
4. Constructing faithful representations of finitely-generated torsion-free nilpotent groups;J. Symbolic Comput.,2002
5. The decision problem for exponential diophantine equations;Ann. of Math. (2),1961
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Knapsack and the power word problem in solvable Baumslag–Solitar groups;International Journal of Algebra and Computation;2023-04-21
2. On the Identity and Group Problems for Complex Heisenberg Matrices;Lecture Notes in Computer Science;2023
3. Exponent equations in HNN-extensions;journal of Groups, complexity, cryptology;2022-12-26
4. Decidability problem for exponential equations in finitely presented groups;Canadian Mathematical Bulletin;2022-11-22
5. Exponent Equations in HNN-extensions;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04