Graph Theoretic Method for Determining non Hurwitz Equivalence in the Braid Group and Symmetric group
M. Teicher, T. Ben-Itzhak
Abstract
Motivated by the problem of Hurwitz equivalence of Δ2 factorization in the braid group, we address the problem of Hurwitz equivalence in the symmetric group, obtained by projecting the Δ2 factorizations into Sn. We get 1Sn factorizations with transposition factors. Looking at the transpositions as the edges in a graph, we show that two factorizations are Hurwitz equivalent if and only if their graphs have the same weighted connected components. The main result of this paper will help us to compute the "Braid Monodromy Type" invariant. The graph structure gives a weaker but very easy to compute invariant to distinguish between diffeomorphic surfaces which are not deformation of each other.
Create a lesson
Related papers
Morphism spaces on low degree hypersurfaces
Hrishabh Mishra
Connecting families of curves
Nathan Chen, Robert Lazarsfeld, Federico Moretti
The Last Picard Rank 1 Double-Mirror Calabi-Yau Pair?
Michał Kapustka, Marco Rampazzo, Prajwal Samal
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers II
Connor Stewart
The Hurwitz existence problem in prime degree
Jijian Song, Hailin Wen, Zebao Zhang
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers I
Andrew Obus, Padmavathi Srinivasan, Connor Stewart