Burns–Macedonska generalized Andrews–Curtis conjecture

Let $G$ be a finitely generated group of rank $n$. An ordered $n$-tuple is normally generating when its components normally generate $G$, and its recalcitrance is the least number of M-transformations needed to reach a generating $n$-tuple, with value infinity when no such transition exists. Burns–Macedonska generalized Andrews–Curtis conjecture. Every normally generating $n$-tuple of $G$ has finite recalcitrance. This generalizes the recalcitrance formulation of the classical Andrews–Curtis conjecture from finitely generated free groups to finitely generated groups; the source presents it as a generalized conjecture associated with Burns and Macedonska.