On generalized braid groups

From MaRDI portal





Let \(\Gamma\) be a finite graph whose edges come in two colours. The generalized braid group associated to \(\Gamma\) has as generators the vertices of \(\Gamma\) and for each edge \(\{\) x,y\(\}^ a \)defining relation \(xyx=yxy\) or \(xy=yx\), depending on the colour of the edge. The classical braid groups of Artin arise in this way from complete graphs with suitable edge-colourings. The authors extend two results of \textit{E. A. Gorin} and \textit{V. Ya. Lin} [Mat. Sb., Nov. Ser. 78(120), 579-610 (1969; Zbl 0211.549)], concerning the derived subgroups of the classical braid groups, to this wider class of groups. Let G be the generalized braid group associated to the edge- coloured graph \(\Gamma\). Theorem 1: the derived subgroup G' of G is free abelian of finite rank (which depends in a transparent way on the colouring). Theorem 2: under certain restrictions on \(\Gamma\), G' is finitely presented. - The proof of Theorem 1 is a straight homological calculation, while that of Theorem 2 involves the elimination of redundant relations by means of van Kampen diagrams.











This page was built for publication: On generalized braid groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3726336)