Related papers: Braid Monodromy Computation of Real Singular Curve…
In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…
We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
Understanding when an abstract complex curve of given genus comes equipped with a map of fixed degree to a projective space of fixed dimension is a foundational question; and Brill--Noether theory addresses this question via linear series,…
In this paper, we study the monodromy of the Hitchin fibration for rank 2 vector bundles over hyperelliptic curves. We reduce the problem to studying a surface braid group generalization of the classical Burau representation, and give a…
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 compute the topological monodromy of every family of complete intersection curves. Like in the case of plane curves previously treated by the second-named author, we find the answer is given by the $r$-spin mapping class group associated…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
Farin proposed a method for designing Bezier curves with monotonic curvature and torsion. Such curves are relevant in design due to their aesthetic shape. The method relies on applying a matrix M to the first edge of the control polygon of…
We establish a braid monodromy representation of functions satisfying an algebraic equation containing three terms (trinomial equation). We follow global analytic continuation of the roots to a trinomial algebraic equation that are…
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…
We give an algorithm for calculating the splitting type of the normal bundle of any rational monomial curve. The algorithm is obtained by reducing the calculus to a combinatorial problem and then by solving this problem.
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
We prove a new patchworking theorem for singular algebraic curves, which states the following. Given a complex toric threefold $Y$ which fibers over ${\mathbb C}$ with a reduced reducible zero fiber $Y_0$ and other fibers $Y_t$ smooth, and…
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…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…