Document Open Access Logo

The Complexity of Knapsack Problems in Wreath Products

Authors Michael Figelius , Moses Ganardi , Markus Lohrey , Georg Zetzsche

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2020.126.pdf
  • Filesize: 0.58 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
Keywords
  • algorithmic group theory
  • knapsack
  • wreath product

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable groups. For a finitely generated group we study the so-called power word problem (does a given expression u₁^{k₁} … u_d^{k_d}, where u₁, …, u_d are words over the group generators and k₁, …, k_d are binary encoded integers, evaluate to the group identity?) and knapsack problem (does a given equation u₁^{x₁} … u_d^{x_d} = v, where u₁, …, u_d,v are words over the group generators and x₁,…,x_d are variables, have a solution in the natural numbers). We prove that the power word problem for wreath products of the form G ≀ ℤ with G nilpotent and iterated wreath products of free abelian groups belongs to TC⁰. As an application of the latter, the power word problem for free solvable groups is in TC⁰. On the other hand we show that for wreath products G ≀ ℤ, where G is a so called uniformly strongly efficiently non-solvable group (which form a large subclass of non-solvable groups), the power word problem is coNP-hard. For the knapsack problem we show NP-completeness for iterated wreath products of free abelian groups and hence free solvable groups. Moreover, the knapsack problem for every wreath product G ≀ ℤ, where G is uniformly efficiently non-solvable, is Σ₂^p-hard.

Cite As Get BibTex

Michael Figelius, Moses Ganardi, Markus Lohrey, and Georg Zetzsche. The Complexity of Knapsack Problems in Wreath Products. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 126:1-126:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.ICALP.2020.126

Author Details

Michael Figelius
  • Universität Siegen, Germany
Moses Ganardi
  • Universität Siegen, Germany
Markus Lohrey
  • Universität Siegen, Germany
Georg Zetzsche
  • Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany

Funding

  • Figelius, Michael: Funded by DFG project LO 748/12-1.
  • Lohrey, Markus: Funded by DFG project LO 748/12-1.

References

  1. Lazlo Babai, Robert Beals, Jin-Yi Cai, Gábor Ivanyos, and Eugene M. Luks. Multiplicative equations over commuting matrices. In Proceedings of SODA 1996, pages 498-507. ACM/SIAM, 1996. Google Scholar
  2. David A. Mix Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹. Journal of Computer and System Sciences, 38:150-164, 1989. Google Scholar
  3. Laurent Bartholdi, Michael Figelius, Markus Lohrey, and Armin Weiß. Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. Technical report, arXiv.org, 2020. URL: http://arxiv.org/abs/1909.13781.
  4. William Boone. The word problem. Annals of Mathematics. Second Series, 70:207-265, 1959. Google Scholar
  5. John W. Cannon, William J. Floyd, and Walter R. Parry. Introductory notes on Richard Thompson’s groups. L'Enseignement Mathématique, 42(3):215-256, 1996. Google Scholar
  6. Anthony E. Clement, Stephen Majewicz, and Marcos Zyman. The Theory of Nilpotent Groups. Springer, 2017. Google Scholar
  7. Max Dehn. Über unendliche diskontinuierliche Gruppen. Mathematische Annalen, 71:116-144, 1911. In German. Google Scholar
  8. Michael Elberfeld, Andreas Jakoby, and Till Tantau. Algorithmic meta theorems for circuit classes of constant and logarithmic depth. Electronic Colloquium on Computational Complexity (ECCC), 18:128, 2011. Google Scholar
  9. Michael Figelius, Moses Ganardi, Markus Lohrey, and Georg Zetzsche. The complexity of knapsack problems in wreath products. CoRR, abs/2002.08086, 2020. URL: http://arxiv.org/abs/2002.08086.
  10. Michael Figelius, Markus Lohrey, and Georg Zetzsche. Closure properties of knapsack semilinear groups. CoRR, abs/1911.12857, 2019. URL: http://arxiv.org/abs/1911.12857.
  11. Elizaveta Frenkel, Andrey Nikolaev, and Alexander Ushakov. Knapsack problems in products of groups. Journal of Symbolic Computation, 74:96-108, 2016. Google Scholar
  12. Moses Ganardi, Daniel König, Markus Lohrey, and Georg Zetzsche. Knapsack problems for wreath products. In Proceedings of STACS 2018, volume 96 of LIPIcs, pages 32:1-32:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  13. Guoqiang Ge. Testing equalities of multiplicative representations in polynomial time (extended abstract). In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, FOCS 1993, pages 422-426. IEEE Computer Society, 1993. Google Scholar
  14. Victor S. Guba and Mark V. Sapir. On subgroups of the R. Thompson group F and other diagram groups. Mat. Sb., 190(8):3-60, 1999. Google Scholar
  15. Christoph Haase. On the complexity of model checking counter automata. PhD thesis, University of Oxford, St Catherine’s College, 2011. Google Scholar
  16. Christoph Haase. Subclasses of Presburger arithmetic and the weak EXP hierarchy. In Proceedings of CSL-LICS 2014, pages 47:1-47:10. ACM, 2014. Google Scholar
  17. Tore Herlestam. On functions of linear shift register sequences. In Proceedings of EUROCRYPT '85, volume 219 of Lecture Notes in Computer Science, pages 119-129. Springer, 1986. Google Scholar
  18. Derek F. Holt, Sarah Rees, and Claas E. Röver. Groups, Languages and Automata, volume 88 of London Mathematical Society Student Texts. Cambridge University Press, 2017. Google Scholar
  19. Dung T. Huynh. Commutative grammars: The complexity of uniform word problems. Information and Control, 57:21-39, 1983. Google Scholar
  20. Dung T. Huynh. The complexity of equivalence problems for commutative grammars. Information and Control, 66(1/2):103-121, 1985. Google Scholar
  21. Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972. Google Scholar
  22. Daniel König, Markus Lohrey, and Georg Zetzsche. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. In Algebra and Computer Science, volume 677 of Contemporary Mathematics, pages 138-153. American Mathematical Society, 2016. Google Scholar
  23. Jörg Lehnert and Pascal Schweitzer. The co-word problem for the Higman-Thompson group is context-free. Bulletin of the London Mathematical Society, 39(2):235-241, 2007. Google Scholar
  24. Markus Lohrey. The Compressed Word Problem for Groups. SpringerBriefs in Mathematics. Springer, 2014. Google Scholar
  25. Markus Lohrey. Knapsack in hyperbolic groups. Journal of Algebra, 545:390-415, 2020. Google Scholar
  26. Markus Lohrey, Benjamin Steinberg, and Georg Zetzsche. Rational subsets and submonoids of wreath products. Information and Computation, 243:191-204, 2015. Google Scholar
  27. Markus Lohrey and Armin Weiß. The power word problem. In Proceedings of MFCS 2019, volume 138 of LIPIcs, pages 43:1-43:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. Google Scholar
  28. Markus Lohrey and Georg Zetzsche. Knapsack in graph groups, HNN-extensions and amalgamated products. In Proceedings of STACS 2016, volume 47 of LIPIcs, pages 50:1-50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  29. Markus Lohrey and Georg Zetzsche. Knapsack in graph groups. Theory of Computing Systems, 62(1):192-246, 2018. Google Scholar
  30. Patrizia Longobardi and Mercede Maj. On some classes of orderable groups. Milan Journal of Mathematics, 68(1):203-216, 1998. Google Scholar
  31. R. C. Lyndon and Paul E. Schupp. Combinatorial Group Theory. Springer, 1977. Google Scholar
  32. Wilhelm Magnus. On a theorem of Marshall Hall. Annals of Mathematics. Second Series, 40:764-768, 1939. Google Scholar
  33. Alexei Miasnikov, Andrey Nikolaev, and Alexander Ushakov. Knapsack problems in groups. Mathematics of Computation, 84:987-1016, 2015. Google Scholar
  34. Alexei Miasnikov, Vitaly Roman'kov, Alexander Ushakov, and Anatoly Vershik. The word and geodesic problems in free solvable groups. Transactions of the American Mathematical Society, 362(9):4655-4682, 2010. Google Scholar
  35. Alexei Miasnikov, Svetla Vassileva, and Armin Weiß. The conjugacy problem in free solvable groups and wreath products of abelian groups is in TC⁰. Theory of Computing Systems, 63(4):809-832, 2019. Google Scholar
  36. Alexei Miasnikov and Armin Weiß. TC⁰ circuits for algorithmic problems in nilpotent groups. In Proceedings of MFCS 2017, volume 83 of LIPIcs, pages 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  37. Alexei Mishchenko and Alexander Treier. Knapsack problem for nilpotent groups. Groups Complexity Cryptology, 9(1):87-98, 2017. Google Scholar
  38. Roberta Mura and Akbar H. Rhemtulla. Orderable groups. Marcel Dekker, 1977. Google Scholar
  39. Bernhard Hermann Neumann. On ordered groups. American Journal of Mathematics, 71(1):1-18, 1949. Google Scholar
  40. Pyotr S. Novikov. On the algorithmic unsolvability of the word problem in group theory. American Mathematical Society, Translations, II. Series, 9:1-122, 1958. Google Scholar
  41. Dale Rolfsen. Low-dimensional topology and ordering groups. Mathematica Slovaca, 64(3):579-600, 2014. Google Scholar
  42. Heribert Vollmer. Introduction to Circuit Complexity. Springer, 1999. Google Scholar
  43. Joachim von zur Gathen and Malte Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72(1):155-158, 1978. Google Scholar
  44. Armin Weiß. Hardness of equations over finite solvable groups under the exponential time hypothesis. CoRR, abs/2002.10145, 2020. URL: http://arxiv.org/abs/2002.10145.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact