Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01373796
Contributor : Thibault Godin <>
Submitted on : Thursday, September 29, 2016 - 11:35:01 AM
Last modification on : Tuesday, December 8, 2020 - 9:44:20 AM
Long-term archiving on: : Friday, December 30, 2016 - 12:45:44 PM

Files

knapsack_arxiv.pdf
Files produced by the author(s)

Identifiers

Citation

Thibault Godin. Knapsack problem for automaton groups. 2016. ⟨hal-01373796⟩

Share

Metrics

Record views

213

Files downloads

195