Centralizers of finite sets of elements of the braid group \({\mathfrak B}_{n+1}\) (Q1065934)

Let \({\mathfrak B}_{n+1}\) be the braid group. The author proves that generators of the centralizer of each finite set of elements of \({\mathfrak B}_{n+1}\) are given by finitely many words in a positive alphabet. Moreover, an algorithm for finding these generators is pointed out. It extends the result of \textit{G. S. Makanin} [cf. Mat. Sb., Nov. Ser. 86(128), 171-179 (1971; Zbl 0229.20035)] about the question raised by \textit{E. Artin} [cf. Abh. Mat. Semin. Univ. Hamb. 4, 47-72 (1926; JFM 51.0450.01)].