相关论文: Braid Group techniques in Complex Geometry V: The …

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

In this paper, we give a fully detailed exposition of computing fundamental groups of complements of line arrangements using the Moishezon-Teicher technique for computing the braid monodromy of a curve and the Van-Kampen theorem which…

This paper is the second in a series of three papers concerning the surface T times T, where T is a complex torus. We compute the fundamental group of the branch curve of the surface in C^2, using the van Kampen Theorem and the braid…

We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of…

Given a projective surface and a generic projection to the plane, the braid monodromy factorization (and thus, the braid monodromy type) of the complement of its branch curve is one of the most important topological invariants, stable on…

The main result in this paper is as follows: Let S be the branch curve (in the projective plan) of a generic projection of a Veronese surface. Then the fundamental group of the complement of S is an extension of a solvable group by a…

We discuss the applications of fundamental groups (of complements of curves) computations (and possibly the computations of the second homotopy group as a model over it) to the classification of algebraic surface. We prove that the…

In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their…

Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve,…

Every smooth minimal complex algebraic surface of general type, $X$, may be mapped into a moduli space, $\MM_{c_1^2(X), c_2(X)}$, of minimal surfaces of general type, all of which have the same Chern numbers. Using the braid group and braid…

Given a singular surface X, one can extract information on it by investigating the fundamental group $\pi_1(X - Sing_X)$. However, calculation of this group is non-trivial, but it can be simplified if a certain invariant of the branch curve…

We compute the presentations of fundamental groups of the complements of a class of rational cuspidal projective plane curves classified by Flenner, Zaidenberg, Fenske and Saito. We use the Zariski-Van Kampen algorithm and exploit the…

We introduce braid monodromy for the discriminant hypersurface in versal unfoldings of hypersurface singularities. Our objective is then to compute this invariant for singularities of Brieskorn Pham type: First we consider the unfolding by…

This paper is the second in a series. The first one describes pillow degenerations of a $K3$ surface with genus $g$. In this paper we study the $(2,2)$-pillow degeneration of a non-prime $K3$ surface and the braid monodromy of the branch…

The braid monodromy factorization of the branch curve of a surface of general type is known to be an invariant that completely determines the diffeomorphism type of the surface. Calculating this factorization is of high technical…

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…

We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…

To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…