Parameterized Complexity of Factorization Problems

We study the parameterized complexity of the following factorization problem: given elements $a,a_1,\dots ,a_m$ of a monoid and a parameter $k$, can $a$ be written as the product of at most (or exactly) $k$ elements from $a_1,\dots ,a_m$. Several new upper bounds and fpt-equivalences with more restricted problems (subset sum and knapsack) are shown. Finally, some new upper bounds for variants of the parameterized change-making problems are shown.