Published online by Cambridge University Press: 05 April 2021
Generalising previous results on classical braid groups by Artin and Lin, we determine the values of m, n ∈ $\mathbb N$ for which there exists a surjection between the n- and m-string braid groups of an orientable surface without boundary. This result is essentially based on specific properties of their lower central series, and the proof is completely combinatorial. We provide similar but partial results in the case of orientable surfaces with boundary components and of non-orientable surfaces without boundary. We give also several results about the classification of different representations of surface braid groups in symmetric groups.
To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.
To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.