×

zbMATH — the first resource for mathematics

A partial order on the symmetric group and new \(K(\pi,1)\)’s for the braid groups. (English) Zbl 1011.20040
The author defines a certain partial order in the symmetric group \(S_n\) using the Cayley graph structure with respect to the set of all transpositions. Then a certain group \(\Gamma_n\) is introduced, which turns out to be isomorphic to the Artin braid group with \(n\) strands, so as to be generated by the elements geodesically governed by the \(n\)-cycle \((1,2,\dots,n)\in S_n\) with explicit defining relations. A certain simplicial complex induced on the vertex set \(\Gamma_n\) is shown to be contractible.

MSC:
20F36 Braid groups; Artin groups
20F05 Generators, relations, and presentations of groups
20B30 Symmetric groups
57M07 Topological methods in group theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Artin, E., Theory of braids, Ann. of math., 48, 101-126, (1947) · Zbl 0030.17703
[2] Birman, J.; Ko, K.H.; Lee, S.J., A new approach to the word and conjugacy problems in the braid groups, Adv. math., 139, 322-353, (1998) · Zbl 0937.20016
[3] T. Brady, Three generator Artin groups of finite type, preprint, 1999.
[4] Charney, R.; Davis, M., Finite K(π, 1)’s for Artin groups, (), 110-124 · Zbl 0930.55006
[5] Epstein, D.B.A., Word processing in groups, (1992), Jones & Bartlett Boston
[6] Fadell, E.; Neuwirth, L., Configuration spaces, Math. scand., 10, 111-118, (1962) · Zbl 0136.44104
[7] Garside, F.A., The braid group and other groups, Quart. J. math. Oxford ser. (2), 20, 235-254, (1969) · Zbl 0194.03303
[8] D. Krammer, The braid group B4 is linear, preprint, 1999.
[9] Kreweras, G., Sur LES partitions non croisees d’un cycle, Discrete math., 1, 333-350, (1972) · Zbl 0231.05014
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.