加载中…
We find a polynomial (n^6) isoperimetric function for Artin groups, the defining graph of which contains no edges labelled by 3. This in particular shows that even Artin groups have solvable word problem. We use small cancellation theory of relative extended presentations.

生成讲解博客的中文版本

生成AI智能校验的中文版本