Knapsack Problems for Wreath Products

In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product. On the other hand, the class of knapsack-semilinear groups, where solutions sets of knapsack equations are effectively semilinear, is closed under wreath product. As a consequence, we obtain the decidability of knapsack for free solvable groups. Finally, it is shown that for every non-trivial abelian group $G$, knapsack (as well as the related subset sum problem) for the wreath product $G \wr \mathbb{Z}$ is NP-complete.

[1]  Alexei Mishchenko,et al.  Knapsack problem for nilpotent groups , 2017, Groups Complex. Cryptol..

[2]  Alexei G. Myasnikov,et al.  Knapsack problems in groups , 2013, Math. Comput..

[3]  Markus Lohrey,et al.  Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups , 2015, AMS-EMS-SPM Joint Meeting.

[4]  Markus Lohrey,et al.  Knapsack in graph groups, HNN-extensions and amalgamated products , 2016, STACS.

[5]  Christoph Haase,et al.  On the complexity of model checking counter automata , 2012 .

[6]  Andreas Jakoby,et al.  Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth , 2012, STACS.

[7]  Tara Davis,et al.  Subgroup distortion in wreath products of cyclic groups , 2010 .

[8]  Christoph Haase,et al.  Subclasses of presburger arithmetic and the weak EXP hierarchy , 2014, CSL-LICS.

[9]  É. Ghys,et al.  Sur Les Groupes Hyperboliques D'Apres Mikhael Gromov , 1990 .

[10]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[11]  Alexei G. Myasnikov,et al.  Verbal subgroups of hyperbolic groups have infinite width , 2011, J. Lond. Math. Soc..

[12]  Andrey Nikolaev,et al.  Knapsack problems in products of groups , 2014, J. Symb. Comput..

[13]  Markus Lohrey,et al.  Algorithmics on SLP-compressed strings: A survey , 2012, Groups Complex. Cryptol..

[14]  Wilhelm Magnus,et al.  On a Theorem for Marshall Hall , 1939 .

[15]  Alexei G. Myasnikov,et al.  TC0 Circuits for Algorithmic Problems in Nilpotent Groups , 2017, MFCS.

[16]  Markus Lohrey,et al.  Evaluation of Circuits Over Nilpotent and Polycyclic Groups , 2017, Algorithmica.

[17]  Eric Allender,et al.  Uniform constant-depth threshold circuits for division and iterated multiplication , 2002, J. Comput. Syst. Sci..

[18]  Markus Lohrey,et al.  Rational subsets and submonoids of wreath products , 2013, Inf. Comput..

[19]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[20]  Markus Lohrey,et al.  The Complexity of Knapsack in Graph Groups , 2017, STACS.

[21]  Jeffrey Shallit,et al.  Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time , 2010, Int. J. Found. Comput. Sci..

[22]  Andrey Nikolaev,et al.  Subset sum problem in polycyclic groups , 2018, J. Symb. Comput..

[23]  Alexei G. Myasnikov,et al.  The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0 , 2018, Theory of Computing Systems.

[24]  J. Lehnert,et al.  The co‐word problem for the Higman‐Thompson group is context‐free , 2007 .