MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Hurwitz Equivalence in Dihedral Groups

Author(s)
Berger, Emily
Thumbnail
DownloadBerger-2011-Hurwitz equivalence.pdf (221.4Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
In this paper we determine the orbits of the braid group B[subscript n] action on G[superscript n] when G is a dihedral group and for any T ∈ G[superscript n]. We prove that the following invariants serve as necessary and sufficient conditions for Hurwitz equivalence. They are: the product of its entries, the subgroup generated by its entries, and the number of times each conjugacy class (in the subgroup generated by its entries) is represented in T.
Date issued
2011-02
URI
http://hdl.handle.net/1721.1/89794
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Berger, Emily. "Hurwitz Equivalence in Dihedral Groups." Electronic Journal of Combinatorics, Volume 18, Issue 1 (2011).
Version: Final published version
ISSN
1077-8926

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.