Knapsack problem for automaton groups
Abstract
The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups. In this paper we deal with groups generated by Mealy automata-a class that is often used to study group-theoretical conjectures-and prove that the knapsack problem is undecidable for this class. In a second time, we construct a graph that, if finite, provides a solution to the knapsack problem. We deduce that the knapsack problem is decidable for the so-called bounded automaton groups, a class where the order and conjugacy problems are already known to be decidable.
Cite
@article{arxiv.1609.09274,
title = {Knapsack problem for automaton groups},
author = {Thibault Godin},
journal= {arXiv preprint arXiv:1609.09274},
year = {2016}
}
Comments
This article has been withdrawn due to a conceptual error in the proof of the decidability of the problem for bounded automata. The undecidability result remains true